%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET044+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:36 EDT 2022
% Result : Theorem 10.50s 2.83s
% Output : CNFRefutation 10.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 3 unt; 3 nHn; 9 RR)
% Number of literals : 21 ( 0 equ; 8 neg)
% Maximal clause size : 2 ( 1 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 : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
( element(X1,esk1_0)
| ~ element(X1,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-82xai2ai/lgb.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
( element(X1,X2)
| element(X1,esk2_1(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-82xai2ai/lgb.p',i_0_1) ).
cnf(i_0_4,negated_conjecture,
( element(X1,X1)
| ~ element(X1,esk1_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-82xai2ai/lgb.p',i_0_4) ).
cnf(i_0_2,negated_conjecture,
( ~ element(X1,X2)
| ~ element(X1,esk2_1(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-82xai2ai/lgb.p',i_0_2) ).
cnf(c_0_9,negated_conjecture,
( element(X1,esk1_0)
| ~ element(X1,X1) ),
i_0_3 ).
cnf(c_0_10,negated_conjecture,
( element(X1,X2)
| element(X1,esk2_1(X2)) ),
i_0_1 ).
cnf(c_0_11,negated_conjecture,
( element(esk2_1(X1),esk1_0)
| element(esk2_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
( element(X1,X1)
| ~ element(X1,esk1_0) ),
i_0_4 ).
cnf(c_0_13,negated_conjecture,
element(esk2_1(esk1_0),esk1_0),
inference(ef,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( ~ element(X1,X2)
| ~ element(X1,esk2_1(X2)) ),
i_0_2 ).
cnf(c_0_15,negated_conjecture,
element(esk2_1(esk1_0),esk2_1(esk1_0)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SET044+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.35 % Computer : n009.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 600
% 0.12/0.35 % DateTime : Mon Jul 11 05:27:53 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 10.50/2.83 # ENIGMATIC: Solved by autoschedule-lgb:
% 10.50/2.83 # No SInE strategy applied
% 10.50/2.83 # Trying AutoSched0 for 150 seconds
% 10.50/2.83 # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 10.50/2.83 # and selection function SelectMaxLComplexAvoidPosPred.
% 10.50/2.83 #
% 10.50/2.83 # Preprocessing time : 0.020 s
% 10.50/2.83
% 10.50/2.83 # Proof found!
% 10.50/2.83 # SZS status Theorem
% 10.50/2.83 # SZS output start CNFRefutation
% See solution above
% 10.50/2.83 # Training examples: 0 positive, 0 negative
% 10.50/2.83
% 10.50/2.83 # -------------------------------------------------
% 10.50/2.83 # User time : 0.021 s
% 10.50/2.83 # System time : 0.006 s
% 10.50/2.83 # Total time : 0.027 s
% 10.50/2.83 # Maximum resident set size: 7120 pages
% 10.50/2.83
%------------------------------------------------------------------------------