TSTP Solution File: SET628+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET628+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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 8.20s 2.52s
% Output : CNFRefutation 8.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 8 unt; 11 nHn; 23 RR)
% Number of literals : 59 ( 11 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
~ member(X1,empty_set),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pohtu727/input.p',i_0_4) ).
cnf(i_0_5,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pohtu727/input.p',i_0_5) ).
cnf(i_0_1,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pohtu727/input.p',i_0_1) ).
cnf(i_0_15,negated_conjecture,
( ~ intersect(esk4_0,esk4_0)
| ~ not_equal(esk4_0,empty_set) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pohtu727/input.p',i_0_15) ).
cnf(i_0_9,plain,
( X1 = X2
| not_equal(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pohtu727/input.p',i_0_9) ).
cnf(i_0_10,plain,
( X1 != X2
| ~ not_equal(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pohtu727/input.p',i_0_10) ).
cnf(i_0_12,plain,
( empty(X1)
| member(esk3_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pohtu727/input.p',i_0_12) ).
cnf(i_0_13,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pohtu727/input.p',i_0_13) ).
cnf(i_0_3,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pohtu727/input.p',i_0_3) ).
cnf(i_0_14,negated_conjecture,
( intersect(esk4_0,esk4_0)
| not_equal(esk4_0,empty_set) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pohtu727/input.p',i_0_14) ).
cnf(c_0_26,plain,
~ member(X1,empty_set),
i_0_4 ).
cnf(c_0_27,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
i_0_5 ).
cnf(c_0_28,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
i_0_1 ).
cnf(c_0_29,plain,
( X1 = empty_set
| member(esk2_2(X1,empty_set),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( ~ intersect(esk4_0,esk4_0)
| ~ not_equal(esk4_0,empty_set) ),
i_0_15 ).
cnf(c_0_31,plain,
( X1 = X2
| not_equal(X1,X2) ),
i_0_9 ).
cnf(c_0_32,plain,
( X1 = empty_set
| intersect(X2,X1)
| ~ member(esk2_2(X1,empty_set),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( empty_set = esk4_0
| ~ intersect(esk4_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( X1 = empty_set
| intersect(X1,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_27]),c_0_26]) ).
cnf(c_0_35,plain,
( X1 != X2
| ~ not_equal(X1,X2) ),
i_0_10 ).
cnf(c_0_36,plain,
( empty(X1)
| member(esk3_1(X1),X1) ),
i_0_12 ).
cnf(c_0_37,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
i_0_13 ).
cnf(c_0_38,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
i_0_3 ).
cnf(c_0_39,negated_conjecture,
( intersect(esk4_0,esk4_0)
| not_equal(esk4_0,empty_set) ),
i_0_14 ).
cnf(c_0_40,plain,
empty_set = esk4_0,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
~ not_equal(X1,X1),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
empty(empty_set),
inference(spm,[status(thm)],[c_0_26,c_0_36]) ).
cnf(c_0_43,plain,
( ~ empty(X1)
| ~ intersect(X1,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
intersect(esk4_0,esk4_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_45,plain,
empty(esk4_0),
inference(rw,[status(thm)],[c_0_42,c_0_40]) ).
cnf(c_0_46,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SET628+3 : TPTP v8.1.0. Released v2.2.0.
% 0.13/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jul 11 02:39:35 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected complete mode:
% 8.20/2.52 # ENIGMATIC: Solved by autoschedule:
% 8.20/2.52 # No SInE strategy applied
% 8.20/2.52 # Trying AutoSched0 for 150 seconds
% 8.20/2.52 # AutoSched0-Mode selected heuristic G_____0010_evo
% 8.20/2.52 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.20/2.52 #
% 8.20/2.52 # Preprocessing time : 0.023 s
% 8.20/2.52
% 8.20/2.52 # Proof found!
% 8.20/2.52 # SZS status Theorem
% 8.20/2.52 # SZS output start CNFRefutation
% See solution above
% 8.20/2.52 # Training examples: 0 positive, 0 negative
% 8.20/2.52
% 8.20/2.52 # -------------------------------------------------
% 8.20/2.52 # User time : 0.023 s
% 8.20/2.52 # System time : 0.007 s
% 8.20/2.52 # Total time : 0.030 s
% 8.20/2.52 # Maximum resident set size: 7120 pages
% 8.20/2.52
%------------------------------------------------------------------------------