%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU150+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:53 EDT 2022
% Result : Theorem 7.67s 2.31s
% Output : CNFRefutation 7.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 14 ( 9 unt; 0 nHn; 12 RR)
% Number of literals : 19 ( 18 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-scsb4ev5/lgb.p',i_0_4) ).
cnf(i_0_6,negated_conjecture,
unordered_pair(esk4_0,esk5_0) = singleton(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-scsb4ev5/lgb.p',i_0_6) ).
cnf(i_0_1,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-scsb4ev5/lgb.p',i_0_1) ).
cnf(i_0_5,negated_conjecture,
esk5_0 != esk4_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-scsb4ev5/lgb.p',i_0_5) ).
cnf(c_0_11,plain,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
i_0_4 ).
cnf(c_0_12,negated_conjecture,
unordered_pair(esk4_0,esk5_0) = singleton(esk3_0),
i_0_6 ).
cnf(c_0_13,negated_conjecture,
( X1 = esk4_0
| singleton(X1) != singleton(esk3_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_1 ).
cnf(c_0_15,negated_conjecture,
esk3_0 = esk4_0,
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( X1 = X2
| singleton(X1) != unordered_pair(X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
unordered_pair(esk4_0,esk5_0) = singleton(esk4_0),
inference(rw,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( X1 = esk5_0
| singleton(X1) != singleton(esk4_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
esk5_0 != esk4_0,
i_0_5 ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU150+3 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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 Jun 19 15:35:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.67/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.67/2.31 # No SInE strategy applied
% 7.67/2.31 # Trying AutoSched0 for 150 seconds
% 7.67/2.31 # AutoSched0-Mode selected heuristic G_E___107_C00_02_nc_F1_PI_AE_Q4_CS_SP_PS_S00EN
% 7.67/2.31 # and selection function PSelectSmallestOrientable.
% 7.67/2.31 #
% 7.67/2.31 # Preprocessing time : 0.012 s
% 7.67/2.31 # Presaturation interreduction done
% 7.67/2.31
% 7.67/2.31 # Proof found!
% 7.67/2.31 # SZS status Theorem
% 7.67/2.31 # SZS output start CNFRefutation
% See solution above
% 7.67/2.31 # Training examples: 0 positive, 0 negative
% 7.67/2.31
% 7.67/2.31 # -------------------------------------------------
% 7.67/2.31 # User time : 0.012 s
% 7.67/2.31 # System time : 0.003 s
% 7.67/2.31 # Total time : 0.015 s
% 7.67/2.31 # Maximum resident set size: 7124 pages
% 7.67/2.31
%------------------------------------------------------------------------------