TSTP Solution File: SET587+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET587+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:27 EDT 2022
% Result : Theorem 8.73s 2.49s
% Output : CNFRefutation 8.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 6 unt; 12 nHn; 21 RR)
% Number of literals : 63 ( 10 equ; 25 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( member(X1,X2)
| member(X1,difference(X3,X2))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ggko7jkq/lgb.p',i_0_3) ).
cnf(i_0_20,negated_conjecture,
( difference(esk5_0,esk6_0) = empty_set
| subset(esk5_0,esk6_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ggko7jkq/lgb.p',i_0_20) ).
cnf(i_0_6,plain,
~ member(X1,empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ggko7jkq/lgb.p',i_0_6) ).
cnf(i_0_9,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ggko7jkq/lgb.p',i_0_9) ).
cnf(i_0_7,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ggko7jkq/lgb.p',i_0_7) ).
cnf(i_0_5,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ggko7jkq/lgb.p',i_0_5) ).
cnf(i_0_8,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ggko7jkq/lgb.p',i_0_8) ).
cnf(i_0_1,plain,
( X1 = X2
| member(esk1_2(X1,X2),X2)
| member(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ggko7jkq/lgb.p',i_0_1) ).
cnf(i_0_4,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ggko7jkq/lgb.p',i_0_4) ).
cnf(i_0_21,negated_conjecture,
( difference(esk5_0,esk6_0) != empty_set
| ~ subset(esk5_0,esk6_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ggko7jkq/lgb.p',i_0_21) ).
cnf(c_0_32,plain,
( member(X1,X2)
| member(X1,difference(X3,X2))
| ~ member(X1,X3) ),
i_0_3 ).
cnf(c_0_33,negated_conjecture,
( difference(esk5_0,esk6_0) = empty_set
| subset(esk5_0,esk6_0) ),
i_0_20 ).
cnf(c_0_34,plain,
~ member(X1,empty_set),
i_0_6 ).
cnf(c_0_35,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
i_0_9 ).
cnf(c_0_36,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
i_0_7 ).
cnf(c_0_37,negated_conjecture,
( member(X1,esk6_0)
| ~ member(X1,esk5_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]) ).
cnf(c_0_38,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
i_0_5 ).
cnf(c_0_39,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
i_0_8 ).
cnf(c_0_40,plain,
( subset(X1,esk6_0)
| ~ member(esk2_2(X1,esk6_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( member(esk2_2(difference(X1,X2),X3),X1)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
subset(difference(esk5_0,X1),esk6_0),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_43,plain,
( X1 = X2
| member(esk1_2(X1,X2),X2)
| member(esk1_2(X1,X2),X1) ),
i_0_1 ).
cnf(c_0_44,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
i_0_4 ).
cnf(c_0_45,plain,
( member(X1,esk6_0)
| ~ member(X1,difference(esk5_0,X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_42]) ).
cnf(c_0_46,plain,
( empty_set = X1
| member(esk1_2(empty_set,X1),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( difference(esk5_0,esk6_0) != empty_set
| ~ subset(esk5_0,esk6_0) ),
i_0_21 ).
cnf(c_0_48,plain,
subset(esk5_0,esk6_0),
inference(spm,[status(thm)],[c_0_40,c_0_39]) ).
cnf(c_0_49,plain,
( X1 = difference(X2,X3)
| member(esk1_2(X1,difference(X2,X3)),X1)
| ~ member(esk1_2(X1,difference(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_44,c_0_43]) ).
cnf(c_0_50,plain,
( difference(esk5_0,X1) = empty_set
| member(esk1_2(empty_set,difference(esk5_0,X1)),esk6_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
difference(esk5_0,esk6_0) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_52,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET587+3 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 : Sat Jul 9 18:40:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 8.73/2.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.73/2.49 # No SInE strategy applied
% 8.73/2.49 # Trying AutoSched0 for 150 seconds
% 8.73/2.49 # AutoSched0-Mode selected heuristic G_____0010_evo
% 8.73/2.49 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.73/2.49 #
% 8.73/2.49 # Preprocessing time : 0.023 s
% 8.73/2.49
% 8.73/2.49 # Proof found!
% 8.73/2.49 # SZS status Theorem
% 8.73/2.49 # SZS output start CNFRefutation
% See solution above
% 8.73/2.49 # Training examples: 0 positive, 0 negative
% 8.73/2.49
% 8.73/2.49 # -------------------------------------------------
% 8.73/2.49 # User time : 0.027 s
% 8.73/2.49 # System time : 0.008 s
% 8.73/2.49 # Total time : 0.035 s
% 8.73/2.49 # Maximum resident set size: 7128 pages
% 8.73/2.49
%------------------------------------------------------------------------------