TSTP Solution File: SET046+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET046+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:08:38 EDT 2022
% Result : Theorem 7.88s 2.37s
% Output : CNFRefutation 7.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 2 unt; 4 nHn; 6 RR)
% Number of literals : 21 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
( ~ element(X1,X2)
| ~ element(X2,X1)
| ~ element(X2,esk1_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-otjj5o__/input.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
( element(X1,esk1_0)
| element(esk2_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-otjj5o__/input.p',i_0_1) ).
cnf(i_0_2,negated_conjecture,
( element(X1,esk1_0)
| element(X1,esk2_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-otjj5o__/input.p',i_0_2) ).
cnf(c_0_7,negated_conjecture,
( ~ element(X1,X2)
| ~ element(X2,X1)
| ~ element(X2,esk1_0) ),
i_0_3 ).
cnf(c_0_8,negated_conjecture,
( element(X1,esk1_0)
| element(esk2_1(X1),X1) ),
i_0_1 ).
cnf(c_0_9,negated_conjecture,
( element(esk1_0,esk1_0)
| ~ element(esk2_1(esk1_0),X1)
| ~ element(X1,esk2_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
( element(X1,esk1_0)
| element(X1,esk2_1(X1)) ),
i_0_2 ).
cnf(c_0_11,negated_conjecture,
element(esk1_0,esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_8]),c_0_10]) ).
cnf(c_0_12,negated_conjecture,
( ~ element(esk1_0,X1)
| ~ element(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET046+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jul 9 18:32:02 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.88/2.37 # ENIGMATIC: Solved by autoschedule:
% 7.88/2.37 # No SInE strategy applied
% 7.88/2.37 # Trying AutoSched0 for 150 seconds
% 7.88/2.37 # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.88/2.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.88/2.37 #
% 7.88/2.37 # Preprocessing time : 0.023 s
% 7.88/2.37
% 7.88/2.37 # Proof found!
% 7.88/2.37 # SZS status Theorem
% 7.88/2.37 # SZS output start CNFRefutation
% See solution above
% 7.88/2.37 # Training examples: 0 positive, 0 negative
% 7.88/2.37
% 7.88/2.37 # -------------------------------------------------
% 7.88/2.37 # User time : 0.024 s
% 7.88/2.37 # System time : 0.004 s
% 7.88/2.37 # Total time : 0.029 s
% 7.88/2.37 # Maximum resident set size: 7116 pages
% 7.88/2.37
%------------------------------------------------------------------------------