%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU158+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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 08:38:58 EDT 2022
% Result : Theorem 7.80s 2.23s
% Output : CNFRefutation 7.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 3 unt; 2 nHn; 11 RR)
% Number of literals : 19 ( 0 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_123,negated_conjecture,
( ~ in(esk20_0,esk21_0)
| ~ subset(unordered_pair(esk20_0,esk20_0),esk21_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mf7npm9s/lgb.p',i_0_123) ).
cnf(i_0_88,lemma,
( in(X1,X2)
| ~ subset(unordered_pair(X1,X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mf7npm9s/lgb.p',i_0_88) ).
cnf(i_0_122,negated_conjecture,
( in(esk20_0,esk21_0)
| subset(unordered_pair(esk20_0,esk20_0),esk21_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mf7npm9s/lgb.p',i_0_122) ).
cnf(i_0_87,lemma,
( subset(unordered_pair(X1,X1),X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mf7npm9s/lgb.p',i_0_87) ).
cnf(c_0_128,negated_conjecture,
( ~ in(esk20_0,esk21_0)
| ~ subset(unordered_pair(esk20_0,esk20_0),esk21_0) ),
i_0_123 ).
cnf(c_0_129,lemma,
( in(X1,X2)
| ~ subset(unordered_pair(X1,X1),X2) ),
i_0_88 ).
cnf(c_0_130,negated_conjecture,
( in(esk20_0,esk21_0)
| subset(unordered_pair(esk20_0,esk20_0),esk21_0) ),
i_0_122 ).
cnf(c_0_131,negated_conjecture,
~ subset(unordered_pair(esk20_0,esk20_0),esk21_0),
inference(csr,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_132,lemma,
( subset(unordered_pair(X1,X1),X2)
| ~ in(X1,X2) ),
i_0_87 ).
cnf(c_0_133,negated_conjecture,
in(esk20_0,esk21_0),
inference(sr,[status(thm)],[c_0_130,c_0_131]) ).
cnf(c_0_134,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_133])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU158+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n014.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 : Mon Jun 20 13:49:19 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.80/2.23 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.80/2.23 # No SInE strategy applied
% 7.80/2.23 # Trying AutoSched0 for 150 seconds
% 7.80/2.23 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 7.80/2.23 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.80/2.23 #
% 7.80/2.23 # Preprocessing time : 0.024 s
% 7.80/2.23 # Presaturation interreduction done
% 7.80/2.23
% 7.80/2.23 # Proof found!
% 7.80/2.23 # SZS status Theorem
% 7.80/2.23 # SZS output start CNFRefutation
% See solution above
% 7.80/2.23 # Training examples: 0 positive, 0 negative
% 7.80/2.23
% 7.80/2.23 # -------------------------------------------------
% 7.80/2.23 # User time : 0.029 s
% 7.80/2.23 # System time : 0.004 s
% 7.80/2.23 # Total time : 0.034 s
% 7.80/2.23 # Maximum resident set size: 7128 pages
% 7.80/2.23
%------------------------------------------------------------------------------