%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET629+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:59 EDT 2022
% Result : Theorem 7.62s 2.39s
% Output : CNFRefutation 7.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 6 unt; 2 nHn; 18 RR)
% Number of literals : 34 ( 0 equ; 18 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_18,negated_conjecture,
~ disjoint(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6un1xlu0/lgb.p',i_0_18) ).
cnf(i_0_10,plain,
( intersect(X1,X2)
| disjoint(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6un1xlu0/lgb.p',i_0_10) ).
cnf(i_0_5,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6un1xlu0/lgb.p',i_0_5) ).
cnf(i_0_9,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6un1xlu0/lgb.p',i_0_9) ).
cnf(i_0_2,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6un1xlu0/lgb.p',i_0_2) ).
cnf(i_0_8,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6un1xlu0/lgb.p',i_0_8) ).
cnf(i_0_13,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6un1xlu0/lgb.p',i_0_13) ).
cnf(c_0_26,negated_conjecture,
~ disjoint(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),
i_0_18 ).
cnf(c_0_27,plain,
( intersect(X1,X2)
| disjoint(X1,X2) ),
i_0_10 ).
cnf(c_0_28,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
i_0_5 ).
cnf(c_0_29,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
i_0_9 ).
cnf(c_0_30,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
i_0_2 ).
cnf(c_0_31,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
i_0_8 ).
cnf(c_0_32,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
i_0_13 ).
cnf(c_0_33,negated_conjecture,
intersect(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( ~ intersect(difference(X1,X2),X3)
| ~ member(esk1_2(difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( member(esk1_2(X1,intersection(X2,X3)),X3)
| ~ intersect(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
intersect(difference(esk3_0,esk4_0),intersection(esk3_0,esk4_0)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
~ intersect(difference(X1,X2),intersection(X3,X2)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
$false,
inference(sr,[status(thm)],[c_0_36,c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET629+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n003.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 09:55:46 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 7.62/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.62/2.39 # No SInE strategy applied
% 7.62/2.39 # Trying AutoSched0 for 150 seconds
% 7.62/2.39 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.62/2.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.62/2.39 #
% 7.62/2.39 # Preprocessing time : 0.023 s
% 7.62/2.39
% 7.62/2.39 # Proof found!
% 7.62/2.39 # SZS status Theorem
% 7.62/2.39 # SZS output start CNFRefutation
% See solution above
% 7.62/2.39 # Training examples: 0 positive, 0 negative
% 7.62/2.39
% 7.62/2.39 # -------------------------------------------------
% 7.62/2.39 # User time : 0.022 s
% 7.62/2.39 # System time : 0.009 s
% 7.62/2.39 # Total time : 0.032 s
% 7.62/2.39 # Maximum resident set size: 7124 pages
% 7.62/2.39
%------------------------------------------------------------------------------