%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU143+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:48 EDT 2022
% Result : Theorem 7.64s 2.32s
% Output : CNFRefutation 7.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 5 unt; 0 nHn; 8 RR)
% Number of literals : 15 ( 8 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 15 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_18,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mdk7ul_q/input.p',i_0_18) ).
cnf(i_0_14,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mdk7ul_q/input.p',i_0_14) ).
cnf(i_0_59,negated_conjecture,
unordered_pair(esk8_0,esk8_0) = empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mdk7ul_q/input.p',i_0_59) ).
cnf(c_0_63,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X4,X3) ),
i_0_18 ).
cnf(c_0_64,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
i_0_14 ).
cnf(c_0_65,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_63])]) ).
cnf(c_0_66,negated_conjecture,
unordered_pair(esk8_0,esk8_0) = empty_set,
i_0_59 ).
cnf(c_0_67,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_64]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU143+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n011.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jun 20 13:47:11 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.64/2.32 # ENIGMATIC: Solved by autoschedule:
% 7.64/2.32 # No SInE strategy applied
% 7.64/2.32 # Trying AutoSched0 for 150 seconds
% 7.64/2.32 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 7.64/2.32 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.64/2.32 #
% 7.64/2.32 # Preprocessing time : 0.013 s
% 7.64/2.32 # Presaturation interreduction done
% 7.64/2.32
% 7.64/2.32 # Proof found!
% 7.64/2.32 # SZS status Theorem
% 7.64/2.32 # SZS output start CNFRefutation
% See solution above
% 7.64/2.32 # Training examples: 0 positive, 0 negative
% 7.64/2.32
% 7.64/2.32 # -------------------------------------------------
% 7.64/2.32 # User time : 0.015 s
% 7.64/2.32 # System time : 0.004 s
% 7.64/2.32 # Total time : 0.019 s
% 7.64/2.32 # Maximum resident set size: 7124 pages
% 7.64/2.32
%------------------------------------------------------------------------------