TSTP Solution File: SEU123+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU123+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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 : Tue Jul 19 08:38:36 EDT 2022
% Result : Theorem 7.37s 2.22s
% Output : CNFRefutation 7.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 7 RR)
% Number of literals : 13 ( 4 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 6 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-988n393y/lgb.p',i_0_3) ).
cnf(i_0_33,negated_conjecture,
subset(esk7_0,empty_set),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-988n393y/lgb.p',i_0_33) ).
cnf(i_0_28,lemma,
subset(empty_set,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-988n393y/lgb.p',i_0_28) ).
cnf(i_0_32,negated_conjecture,
esk7_0 != empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-988n393y/lgb.p',i_0_32) ).
cnf(c_0_38,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_3 ).
cnf(c_0_39,negated_conjecture,
subset(esk7_0,empty_set),
i_0_33 ).
cnf(c_0_40,lemma,
subset(empty_set,X1),
i_0_28 ).
cnf(c_0_41,negated_conjecture,
esk7_0 != empty_set,
i_0_32 ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU123+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 : Sun Jun 19 17:00:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.37/2.22 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.37/2.22 # No SInE strategy applied
% 7.37/2.22 # Trying AutoSched0 for 150 seconds
% 7.37/2.22 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S00AA
% 7.37/2.22 # and selection function SelectLargestOrientable.
% 7.37/2.22 #
% 7.37/2.22 # Preprocessing time : 0.023 s
% 7.37/2.22 # Presaturation interreduction done
% 7.37/2.22
% 7.37/2.22 # Proof found!
% 7.37/2.22 # SZS status Theorem
% 7.37/2.22 # SZS output start CNFRefutation
% See solution above
% 7.37/2.22 # Training examples: 0 positive, 0 negative
% 7.37/2.22
% 7.37/2.22 # -------------------------------------------------
% 7.37/2.22 # User time : 0.026 s
% 7.37/2.22 # System time : 0.005 s
% 7.37/2.22 # Total time : 0.030 s
% 7.37/2.22 # Maximum resident set size: 7120 pages
% 7.37/2.22
%------------------------------------------------------------------------------