%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG030+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 : Thu Jul 14 14:44:13 EDT 2022
% Result : Theorem 4.76s 2.31s
% Output : CNFRefutation 4.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 10 unt; 0 nHn; 22 RR)
% Number of literals : 41 ( 11 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,negated_conjecture,
( j(h(X1)) = X1
| ~ sorti1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wmftvvu_/input.p',i_0_7) ).
cnf(i_0_10,negated_conjecture,
( op2(h(X1),h(X2)) = h(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wmftvvu_/input.p',i_0_10) ).
cnf(i_0_1,plain,
( sorti1(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wmftvvu_/input.p',i_0_1) ).
cnf(i_0_3,plain,
op1(esk1_0,esk2_0) != op1(esk2_0,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wmftvvu_/input.p',i_0_3) ).
cnf(i_0_4,plain,
sorti1(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wmftvvu_/input.p',i_0_4) ).
cnf(i_0_5,plain,
sorti1(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wmftvvu_/input.p',i_0_5) ).
cnf(i_0_6,plain,
( op2(X1,X2) = op2(X2,X1)
| ~ sorti2(X2)
| ~ sorti2(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wmftvvu_/input.p',i_0_6) ).
cnf(i_0_12,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wmftvvu_/input.p',i_0_12) ).
cnf(c_0_21,negated_conjecture,
( j(h(X1)) = X1
| ~ sorti1(X1) ),
i_0_7 ).
cnf(c_0_22,negated_conjecture,
( op2(h(X1),h(X2)) = h(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
i_0_10 ).
cnf(c_0_23,plain,
( sorti1(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
i_0_1 ).
cnf(c_0_24,plain,
op1(esk1_0,esk2_0) != op1(esk2_0,esk1_0),
i_0_3 ).
cnf(c_0_25,negated_conjecture,
( op1(X1,X2) = j(op2(h(X1),h(X2)))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,plain,
sorti1(esk2_0),
i_0_4 ).
cnf(c_0_27,plain,
sorti1(esk1_0),
i_0_5 ).
cnf(c_0_28,plain,
op1(esk2_0,esk1_0) != j(op2(h(esk1_0),h(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_29,negated_conjecture,
j(op2(h(esk1_0),h(esk2_0))) != j(op2(h(esk2_0),h(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_27]),c_0_26])]) ).
cnf(c_0_30,plain,
( op2(X1,X2) = op2(X2,X1)
| ~ sorti2(X2)
| ~ sorti2(X1) ),
i_0_6 ).
cnf(c_0_31,plain,
( ~ sorti2(h(esk2_0))
| ~ sorti2(h(esk1_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
i_0_12 ).
cnf(c_0_33,negated_conjecture,
~ sorti2(h(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27])]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_32]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ALG030+1 : TPTP v8.1.0. Released v2.7.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n017.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 8 23:52:20 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected complete mode:
% 4.76/2.31 # ENIGMATIC: Solved by autoschedule:
% 4.76/2.31 # No SInE strategy applied
% 4.76/2.31 # Trying AutoSched0 for 150 seconds
% 4.76/2.31 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 4.76/2.31 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.76/2.31 #
% 4.76/2.31 # Preprocessing time : 0.023 s
% 4.76/2.31 # Presaturation interreduction done
% 4.76/2.31
% 4.76/2.31 # Proof found!
% 4.76/2.31 # SZS status Theorem
% 4.76/2.31 # SZS output start CNFRefutation
% See solution above
% 4.76/2.31 # Training examples: 0 positive, 0 negative
% 4.76/2.31
% 4.76/2.31 # -------------------------------------------------
% 4.76/2.31 # User time : 0.023 s
% 4.76/2.31 # System time : 0.006 s
% 4.76/2.31 # Total time : 0.029 s
% 4.76/2.31 # Maximum resident set size: 7120 pages
% 4.76/2.31
%------------------------------------------------------------------------------