TSTP Solution File: NUM550+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM550+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 08:37:15 EDT 2022
% Result : Theorem 7.59s 2.28s
% Output : CNFRefutation 7.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 11 unt; 0 nHn; 13 RR)
% Number of literals : 17 ( 11 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_119,hypothesis,
sbrdtbr0(xQ) = xk,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x3cvnisv/lgb.p',i_0_119) ).
cnf(i_0_122,negated_conjecture,
xQ = slcrc0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x3cvnisv/lgb.p',i_0_122) ).
cnf(i_0_121,hypothesis,
aSet0(xQ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x3cvnisv/lgb.p',i_0_121) ).
cnf(i_0_68,plain,
( sbrdtbr0(X1) = sz00
| X1 != slcrc0
| ~ aSet0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x3cvnisv/lgb.p',i_0_68) ).
cnf(i_0_112,hypothesis,
sz00 != xk,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x3cvnisv/lgb.p',i_0_112) ).
cnf(c_0_128,hypothesis,
sbrdtbr0(xQ) = xk,
i_0_119 ).
cnf(c_0_129,negated_conjecture,
xQ = slcrc0,
i_0_122 ).
cnf(c_0_130,hypothesis,
aSet0(xQ),
i_0_121 ).
cnf(c_0_131,plain,
( sbrdtbr0(X1) = sz00
| X1 != slcrc0
| ~ aSet0(X1) ),
i_0_68 ).
cnf(c_0_132,hypothesis,
sbrdtbr0(slcrc0) = xk,
inference(rw,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_133,hypothesis,
aSet0(slcrc0),
inference(rw,[status(thm)],[c_0_130,c_0_129]) ).
cnf(c_0_134,hypothesis,
sz00 != xk,
i_0_112 ).
cnf(c_0_135,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_131]),c_0_132]),c_0_133])]),c_0_134]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM550+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n006.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jul 5 19:41:39 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.59/2.28 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.59/2.28 # No SInE strategy applied
% 7.59/2.28 # Trying AutoSched0 for 150 seconds
% 7.59/2.28 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.59/2.28 # and selection function SelectNewComplexAHP.
% 7.59/2.28 #
% 7.59/2.28 # Preprocessing time : 0.025 s
% 7.59/2.28 # Presaturation interreduction done
% 7.59/2.28
% 7.59/2.28 # Proof found!
% 7.59/2.28 # SZS status Theorem
% 7.59/2.28 # SZS output start CNFRefutation
% See solution above
% 7.59/2.28 # Training examples: 0 positive, 0 negative
% 7.59/2.28
% 7.59/2.28 # -------------------------------------------------
% 7.59/2.28 # User time : 0.025 s
% 7.59/2.28 # System time : 0.006 s
% 7.59/2.28 # Total time : 0.032 s
% 7.59/2.28 # Maximum resident set size: 7128 pages
% 7.59/2.28
%------------------------------------------------------------------------------