TSTP Solution File: SET588+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET588+3 : TPTP v8.1.0. Released v2.2.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 00:12:28 EDT 2022
% Result : Theorem 7.21s 2.22s
% Output : CNFRefutation 7.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 7 unt; 8 nHn; 18 RR)
% Number of literals : 52 ( 0 equ; 21 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 : 51 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2fea6kh_/lgb.p',i_0_6) ).
cnf(i_0_9,negated_conjecture,
subset(esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2fea6kh_/lgb.p',i_0_9) ).
cnf(i_0_4,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2fea6kh_/lgb.p',i_0_4) ).
cnf(i_0_3,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2fea6kh_/lgb.p',i_0_3) ).
cnf(i_0_5,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2fea6kh_/lgb.p',i_0_5) ).
cnf(i_0_1,plain,
( member(X1,X2)
| member(X1,difference(X3,X2))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2fea6kh_/lgb.p',i_0_1) ).
cnf(i_0_2,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2fea6kh_/lgb.p',i_0_2) ).
cnf(i_0_8,negated_conjecture,
~ subset(difference(esk2_0,esk4_0),difference(esk3_0,esk4_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2fea6kh_/lgb.p',i_0_8) ).
cnf(c_0_18,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
i_0_6 ).
cnf(c_0_19,negated_conjecture,
subset(esk2_0,esk3_0),
i_0_9 ).
cnf(c_0_20,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
i_0_4 ).
cnf(c_0_21,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
i_0_3 ).
cnf(c_0_23,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
i_0_5 ).
cnf(c_0_24,plain,
( subset(X1,esk3_0)
| ~ member(esk1_2(X1,esk3_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( member(esk1_2(difference(X1,X2),X3),X1)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
subset(difference(esk2_0,X1),esk3_0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
( member(X1,X2)
| member(X1,difference(X3,X2))
| ~ member(X1,X3) ),
i_0_1 ).
cnf(c_0_28,plain,
( member(X1,esk3_0)
| ~ member(X1,difference(esk2_0,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_29,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
i_0_2 ).
cnf(c_0_30,plain,
( member(esk1_2(X1,difference(X2,X3)),X3)
| subset(X1,difference(X2,X3))
| ~ member(esk1_2(X1,difference(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_31,plain,
( member(esk1_2(difference(esk2_0,X1),X2),esk3_0)
| subset(difference(esk2_0,X1),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_32,plain,
( subset(difference(X1,X2),X3)
| ~ member(esk1_2(difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_23]) ).
cnf(c_0_33,plain,
( member(esk1_2(difference(esk2_0,X1),difference(esk3_0,X2)),X2)
| subset(difference(esk2_0,X1),difference(esk3_0,X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
~ subset(difference(esk2_0,esk4_0),difference(esk3_0,esk4_0)),
i_0_8 ).
cnf(c_0_35,plain,
subset(difference(esk2_0,X1),difference(esk3_0,X1)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET588+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % 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.34 % DateTime : Sat Jul 9 21:00:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.21/2.22 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.21/2.22 # No SInE strategy applied
% 7.21/2.22 # Trying AutoSched0 for 150 seconds
% 7.21/2.22 # AutoSched0-Mode selected heuristic G_E___041_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 7.21/2.22 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.21/2.22 #
% 7.21/2.22 # Preprocessing time : 0.023 s
% 7.21/2.22
% 7.21/2.22 # Proof found!
% 7.21/2.22 # SZS status Theorem
% 7.21/2.22 # SZS output start CNFRefutation
% See solution above
% 7.21/2.22 # Training examples: 0 positive, 0 negative
% 7.21/2.22
% 7.21/2.22 # -------------------------------------------------
% 7.21/2.22 # User time : 0.023 s
% 7.21/2.22 # System time : 0.007 s
% 7.21/2.22 # Total time : 0.030 s
% 7.21/2.22 # Maximum resident set size: 7124 pages
% 7.21/2.22
%------------------------------------------------------------------------------