TSTP Solution File: SET631+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET631+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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 00:13:01 EDT 2022
% Result : Theorem 8.37s 2.38s
% Output : CNFRefutation 8.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 6 unt; 0 nHn; 19 RR)
% Number of literals : 35 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rio9z2k_/input.p',i_0_4) ).
cnf(i_0_6,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rio9z2k_/input.p',i_0_6) ).
cnf(i_0_3,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rio9z2k_/input.p',i_0_3) ).
cnf(i_0_5,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rio9z2k_/input.p',i_0_5) ).
cnf(i_0_9,negated_conjecture,
intersect(esk2_0,difference(esk3_0,esk4_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rio9z2k_/input.p',i_0_9) ).
cnf(i_0_7,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rio9z2k_/input.p',i_0_7) ).
cnf(i_0_8,negated_conjecture,
~ intersect(esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rio9z2k_/input.p',i_0_8) ).
cnf(c_0_17,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
i_0_4 ).
cnf(c_0_18,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
i_0_6 ).
cnf(c_0_19,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
i_0_3 ).
cnf(c_0_20,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
i_0_5 ).
cnf(c_0_21,plain,
( intersect(X1,X2)
| ~ member(esk1_2(X2,X3),X1)
| ~ intersect(X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( member(esk1_2(X1,difference(X2,X3)),X2)
| ~ intersect(X1,difference(X2,X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( intersect(X1,X2)
| ~ intersect(X2,difference(X1,X3)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
intersect(esk2_0,difference(esk3_0,esk4_0)),
i_0_9 ).
cnf(c_0_25,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
i_0_7 ).
cnf(c_0_26,negated_conjecture,
intersect(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
~ intersect(esk2_0,esk3_0),
i_0_8 ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET631+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 00:16:12 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected complete mode:
% 8.37/2.38 # ENIGMATIC: Solved by autoschedule:
% 8.37/2.38 # No SInE strategy applied
% 8.37/2.38 # Trying AutoSched0 for 150 seconds
% 8.37/2.38 # AutoSched0-Mode selected heuristic G_E___041_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 8.37/2.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.37/2.38 #
% 8.37/2.38 # Preprocessing time : 0.023 s
% 8.37/2.38
% 8.37/2.38 # Proof found!
% 8.37/2.38 # SZS status Theorem
% 8.37/2.38 # SZS output start CNFRefutation
% See solution above
% 8.37/2.38 # Training examples: 0 positive, 0 negative
% 8.37/2.38
% 8.37/2.38 # -------------------------------------------------
% 8.37/2.38 # User time : 0.025 s
% 8.37/2.38 # System time : 0.007 s
% 8.37/2.38 # Total time : 0.032 s
% 8.37/2.38 # Maximum resident set size: 7124 pages
% 8.37/2.38
%------------------------------------------------------------------------------