TSTP Solution File: NUM565+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM565+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:25 EDT 2022
% Result : Theorem 9.25s 3.30s
% Output : CNFRefutation 9.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 8 unt; 0 nHn; 10 RR)
% Number of literals : 14 ( 9 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_69,plain,
( X1 = slcrc0
| sbrdtbr0(X1) != sz00
| ~ aSet0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dwzo9gz6/lgb.p',i_0_69) ).
cnf(i_0_4146,negated_conjecture,
sbrdtbr0(esk31_0) = sz00,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dwzo9gz6/lgb.p',i_0_4146) ).
cnf(i_0_4149,negated_conjecture,
aSet0(esk31_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dwzo9gz6/lgb.p',i_0_4149) ).
cnf(i_0_4142,negated_conjecture,
sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,esk31_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dwzo9gz6/lgb.p',i_0_4142) ).
cnf(c_0_4154,plain,
( X1 = slcrc0
| sbrdtbr0(X1) != sz00
| ~ aSet0(X1) ),
i_0_69 ).
cnf(c_0_4155,negated_conjecture,
sbrdtbr0(esk31_0) = sz00,
i_0_4146 ).
cnf(c_0_4156,negated_conjecture,
aSet0(esk31_0),
i_0_4149 ).
cnf(c_0_4157,negated_conjecture,
sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,esk31_0),
i_0_4142 ).
cnf(c_0_4158,negated_conjecture,
esk31_0 = slcrc0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4154,c_0_4155]),c_0_4156])]) ).
cnf(c_0_4159,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4157,c_0_4158])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM565+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 : n008.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 : Fri Jul 8 02:19:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 9.25/3.30 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.25/3.30 # No SInE strategy applied
% 9.25/3.30 # Trying AutoSched0 for 150 seconds
% 9.25/3.30 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_S0Y
% 9.25/3.30 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.25/3.30 #
% 9.25/3.30 # Preprocessing time : 0.026 s
% 9.25/3.30
% 9.25/3.30 # Proof found!
% 9.25/3.30 # SZS status Theorem
% 9.25/3.30 # SZS output start CNFRefutation
% See solution above
% 9.25/3.30 # Training examples: 0 positive, 0 negative
% 9.25/3.30
% 9.25/3.30 # -------------------------------------------------
% 9.25/3.30 # User time : 0.026 s
% 9.25/3.30 # System time : 0.009 s
% 9.25/3.30 # Total time : 0.035 s
% 9.25/3.30 # Maximum resident set size: 7124 pages
% 9.25/3.30
%------------------------------------------------------------------------------