TSTP Solution File: SET591+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET591+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:30 EDT 2022
% Result : Theorem 6.70s 2.34s
% Output : CNFRefutation 6.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 10 unt; 2 nHn; 15 RR)
% Number of literals : 32 ( 5 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
~ member(X1,empty_set),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9lrepg_a/input.p',i_0_7) ).
cnf(i_0_2,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9lrepg_a/input.p',i_0_2) ).
cnf(i_0_3,plain,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9lrepg_a/input.p',i_0_3) ).
cnf(i_0_15,negated_conjecture,
subset(esk3_0,difference(esk4_0,esk3_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9lrepg_a/input.p',i_0_15) ).
cnf(i_0_5,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9lrepg_a/input.p',i_0_5) ).
cnf(i_0_8,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9lrepg_a/input.p',i_0_8) ).
cnf(i_0_14,negated_conjecture,
empty_set != esk3_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9lrepg_a/input.p',i_0_14) ).
cnf(c_0_23,plain,
~ member(X1,empty_set),
i_0_7 ).
cnf(c_0_24,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
i_0_2 ).
cnf(c_0_25,plain,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
i_0_3 ).
cnf(c_0_26,negated_conjecture,
subset(esk3_0,difference(esk4_0,esk3_0)),
i_0_15 ).
cnf(c_0_27,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
i_0_5 ).
cnf(c_0_28,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_8 ).
cnf(c_0_29,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
~ member(X1,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_31,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
subset(esk3_0,X1),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_33,negated_conjecture,
empty_set != esk3_0,
i_0_14 ).
cnf(c_0_34,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET591+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.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 : Sun Jul 10 12:25:48 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 6.70/2.34 # ENIGMATIC: Solved by autoschedule:
% 6.70/2.34 # No SInE strategy applied
% 6.70/2.34 # Trying AutoSched0 for 150 seconds
% 6.70/2.34 # AutoSched0-Mode selected heuristic G_____0010_evo
% 6.70/2.34 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.70/2.34 #
% 6.70/2.34 # Preprocessing time : 0.013 s
% 6.70/2.34
% 6.70/2.34 # Proof found!
% 6.70/2.34 # SZS status Theorem
% 6.70/2.34 # SZS output start CNFRefutation
% See solution above
% 6.70/2.34 # Training examples: 0 positive, 0 negative
% 6.70/2.34
% 6.70/2.34 # -------------------------------------------------
% 6.70/2.34 # User time : 0.012 s
% 6.70/2.34 # System time : 0.006 s
% 6.70/2.34 # Total time : 0.019 s
% 6.70/2.34 # Maximum resident set size: 7120 pages
% 6.70/2.34
%------------------------------------------------------------------------------