TSTP Solution File: SET573+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET573+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:19 EDT 2022
% Result : Theorem 4.48s 2.06s
% Output : CNFRefutation 4.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 8 unt; 0 nHn; 13 RR)
% Number of literals : 20 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ggybtxzq/input.p',i_0_1) ).
cnf(i_0_7,negated_conjecture,
member(esk2_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ggybtxzq/input.p',i_0_7) ).
cnf(i_0_5,plain,
( ~ intersect(X1,X2)
| ~ disjoint(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ggybtxzq/input.p',i_0_5) ).
cnf(i_0_8,negated_conjecture,
disjoint(esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ggybtxzq/input.p',i_0_8) ).
cnf(i_0_9,negated_conjecture,
member(esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ggybtxzq/input.p',i_0_9) ).
cnf(c_0_15,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
i_0_1 ).
cnf(c_0_16,negated_conjecture,
member(esk2_0,esk4_0),
i_0_7 ).
cnf(c_0_17,plain,
( ~ intersect(X1,X2)
| ~ disjoint(X1,X2) ),
i_0_5 ).
cnf(c_0_18,negated_conjecture,
disjoint(esk3_0,esk4_0),
i_0_8 ).
cnf(c_0_19,negated_conjecture,
( intersect(X1,esk4_0)
| ~ member(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
member(esk2_0,esk3_0),
i_0_9 ).
cnf(c_0_21,negated_conjecture,
~ intersect(esk3_0,esk4_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET573+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n018.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun Jul 10 05:59:14 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 4.48/2.06 # ENIGMATIC: Solved by autoschedule:
% 4.48/2.06 # No SInE strategy applied
% 4.48/2.06 # Trying AutoSched0 for 150 seconds
% 4.48/2.06 # AutoSched0-Mode selected heuristic G_E___042_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 4.48/2.06 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.48/2.06 #
% 4.48/2.06 # Preprocessing time : 0.012 s
% 4.48/2.06 # Presaturation interreduction done
% 4.48/2.06
% 4.48/2.06 # Proof found!
% 4.48/2.06 # SZS status Theorem
% 4.48/2.06 # SZS output start CNFRefutation
% See solution above
% 4.48/2.06 # Training examples: 0 positive, 0 negative
% 4.48/2.06
% 4.48/2.06 # -------------------------------------------------
% 4.48/2.06 # User time : 0.013 s
% 4.48/2.06 # System time : 0.002 s
% 4.48/2.06 # Total time : 0.015 s
% 4.48/2.06 # Maximum resident set size: 7120 pages
% 4.48/2.06
%------------------------------------------------------------------------------