TSTP Solution File: NUM550+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM550+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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.60s 2.37s
% Output : CNFRefutation 7.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 15 ( 10 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_68,plain,
( sbrdtbr0(X1) = sz00
| X1 != slcrc0
| ~ aSet0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qaeqg_qg/lgb.p',i_0_68) ).
cnf(i_0_151,negated_conjecture,
xQ = slcrc0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qaeqg_qg/lgb.p',i_0_151) ).
cnf(i_0_148,hypothesis,
sbrdtbr0(xQ) = xk,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qaeqg_qg/lgb.p',i_0_148) ).
cnf(i_0_150,hypothesis,
aSet0(xQ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qaeqg_qg/lgb.p',i_0_150) ).
cnf(i_0_112,hypothesis,
sz00 != xk,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qaeqg_qg/lgb.p',i_0_112) ).
cnf(c_0_157,plain,
( sbrdtbr0(X1) = sz00
| X1 != slcrc0
| ~ aSet0(X1) ),
i_0_68 ).
cnf(c_0_158,negated_conjecture,
xQ = slcrc0,
i_0_151 ).
cnf(c_0_159,hypothesis,
sbrdtbr0(xQ) = xk,
i_0_148 ).
cnf(c_0_160,hypothesis,
aSet0(xQ),
i_0_150 ).
cnf(c_0_161,hypothesis,
sz00 != xk,
i_0_112 ).
cnf(c_0_162,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_157,c_0_158])]),c_0_159]),c_0_160])]),c_0_161]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM550+3 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jul 6 17:14:30 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.60/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.60/2.37 # No SInE strategy applied
% 7.60/2.37 # Trying AutoSched0 for 150 seconds
% 7.60/2.37 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.60/2.37 # and selection function SelectNewComplexAHP.
% 7.60/2.37 #
% 7.60/2.37 # Preprocessing time : 0.020 s
% 7.60/2.37 # Presaturation interreduction done
% 7.60/2.37
% 7.60/2.37 # Proof found!
% 7.60/2.37 # SZS status Theorem
% 7.60/2.37 # SZS output start CNFRefutation
% See solution above
% 7.60/2.37 # Training examples: 0 positive, 0 negative
% 7.60/2.37
% 7.60/2.37 # -------------------------------------------------
% 7.60/2.37 # User time : 0.021 s
% 7.60/2.37 # System time : 0.002 s
% 7.60/2.37 # Total time : 0.024 s
% 7.60/2.37 # Maximum resident set size: 7128 pages
% 7.60/2.37
%------------------------------------------------------------------------------