%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG040+1 : TPTP v8.1.0. Released v2.7.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 : Thu Jul 14 14:44:15 EDT 2022
% Result : Theorem 7.52s 2.36s
% Output : CNFRefutation 7.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 4 unt; 0 nHn; 24 RR)
% Number of literals : 50 ( 12 equ; 32 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jonoby9s/lgb.p',i_0_8) ).
cnf(i_0_9,negated_conjecture,
( op1(j(X1),j(X2)) = j(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jonoby9s/lgb.p',i_0_9) ).
cnf(i_0_2,plain,
( sorti2(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jonoby9s/lgb.p',i_0_2) ).
cnf(i_0_5,plain,
( op2(esk2_1(X1),esk2_1(X1)) != X1
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jonoby9s/lgb.p',i_0_5) ).
cnf(i_0_6,plain,
( sorti2(esk2_1(X1))
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jonoby9s/lgb.p',i_0_6) ).
cnf(i_0_3,plain,
( op1(X1,X1) = esk1_0
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jonoby9s/lgb.p',i_0_3) ).
cnf(i_0_11,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jonoby9s/lgb.p',i_0_11) ).
cnf(i_0_12,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jonoby9s/lgb.p',i_0_12) ).
cnf(i_0_4,plain,
sorti1(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jonoby9s/lgb.p',i_0_4) ).
cnf(c_0_22,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
i_0_8 ).
cnf(c_0_23,negated_conjecture,
( op1(j(X1),j(X2)) = j(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
i_0_9 ).
cnf(c_0_24,plain,
( sorti2(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
i_0_2 ).
cnf(c_0_25,plain,
( op2(esk2_1(X1),esk2_1(X1)) != X1
| ~ sorti2(X1) ),
i_0_5 ).
cnf(c_0_26,negated_conjecture,
( op2(X1,X2) = h(op1(j(X1),j(X2)))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_27,plain,
( sorti2(esk2_1(X1))
| ~ sorti2(X1) ),
i_0_6 ).
cnf(c_0_28,plain,
( h(op1(j(esk2_1(X1)),j(esk2_1(X1)))) != X1
| ~ sorti2(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_29,plain,
( op1(X1,X1) = esk1_0
| ~ sorti1(X1) ),
i_0_3 ).
cnf(c_0_30,plain,
( h(esk1_0) != X1
| ~ sorti2(X1)
| ~ sorti1(j(esk2_1(X1))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
i_0_11 ).
cnf(c_0_32,negated_conjecture,
( h(esk1_0) != X1
| ~ sorti2(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27]) ).
cnf(c_0_33,negated_conjecture,
~ sorti2(h(esk1_0)),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_34,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
i_0_12 ).
cnf(c_0_35,plain,
sorti1(esk1_0),
i_0_4 ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : ALG040+1 : TPTP v8.1.0. Released v2.7.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 : Wed Jun 8 01:48:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.52/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.52/2.36 # No SInE strategy applied
% 7.52/2.36 # Trying AutoSched0 for 150 seconds
% 7.52/2.36 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 7.52/2.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.52/2.36 #
% 7.52/2.36 # Preprocessing time : 0.023 s
% 7.52/2.36 # Presaturation interreduction done
% 7.52/2.36
% 7.52/2.36 # Proof found!
% 7.52/2.36 # SZS status Theorem
% 7.52/2.36 # SZS output start CNFRefutation
% See solution above
% 7.52/2.36 # Training examples: 0 positive, 0 negative
% 7.52/2.36
% 7.52/2.36 # -------------------------------------------------
% 7.52/2.36 # User time : 0.024 s
% 7.52/2.36 # System time : 0.004 s
% 7.52/2.36 # Total time : 0.028 s
% 7.52/2.36 # Maximum resident set size: 7124 pages
% 7.52/2.36
%------------------------------------------------------------------------------