TSTP Solution File: ALG069+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG069+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:51:35 EDT 2022
% Result : Theorem 7.27s 1.99s
% Output : CNFRefutation 7.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 3 unt; 0 nHn; 20 RR)
% Number of literals : 39 ( 11 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 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 : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
( op2(X1,X1) != esk2_0
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1bfni7ll/input.p',i_0_5) ).
cnf(i_0_10,negated_conjecture,
( op2(h(X1),h(X2)) = h(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1bfni7ll/input.p',i_0_10) ).
cnf(i_0_12,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1bfni7ll/input.p',i_0_12) ).
cnf(i_0_3,plain,
( op1(esk1_1(X1),esk1_1(X1)) = X1
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1bfni7ll/input.p',i_0_3) ).
cnf(i_0_4,plain,
( sorti1(esk1_1(X1))
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1bfni7ll/input.p',i_0_4) ).
cnf(i_0_8,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1bfni7ll/input.p',i_0_8) ).
cnf(i_0_11,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1bfni7ll/input.p',i_0_11) ).
cnf(i_0_6,plain,
sorti2(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1bfni7ll/input.p',i_0_6) ).
cnf(c_0_21,plain,
( op2(X1,X1) != esk2_0
| ~ sorti2(X1) ),
i_0_5 ).
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,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
i_0_12 ).
cnf(c_0_24,plain,
( h(op1(X1,X1)) != esk2_0
| ~ sorti1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_25,plain,
( op1(esk1_1(X1),esk1_1(X1)) = X1
| ~ sorti1(X1) ),
i_0_3 ).
cnf(c_0_26,plain,
( sorti1(esk1_1(X1))
| ~ sorti1(X1) ),
i_0_4 ).
cnf(c_0_27,plain,
( h(X1) != esk2_0
| ~ sorti1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
i_0_8 ).
cnf(c_0_29,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
i_0_11 ).
cnf(c_0_30,negated_conjecture,
( X1 != esk2_0
| ~ sorti2(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_31,plain,
sorti2(esk2_0),
i_0_6 ).
cnf(c_0_32,plain,
$false,
inference(spm,[status(thm)],[c_0_30,c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : ALG069+1 : TPTP v8.1.0. Released v2.7.0.
% 0.00/0.08 % Command : enigmatic-eprover.py %s %d 1
% 0.07/0.26 % Computer : n032.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Wed Jun 8 16:46:24 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.10/0.34 # ENIGMATIC: Selected complete mode:
% 7.27/1.99 # ENIGMATIC: Solved by autoschedule:
% 7.27/1.99 # No SInE strategy applied
% 7.27/1.99 # Trying AutoSched0 for 150 seconds
% 7.27/1.99 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 7.27/1.99 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.27/1.99 #
% 7.27/1.99 # Preprocessing time : 0.016 s
% 7.27/1.99 # Presaturation interreduction done
% 7.27/1.99
% 7.27/1.99 # Proof found!
% 7.27/1.99 # SZS status Theorem
% 7.27/1.99 # SZS output start CNFRefutation
% See solution above
% 7.27/1.99 # Training examples: 0 positive, 0 negative
% 7.27/1.99
% 7.27/1.99 # -------------------------------------------------
% 7.27/1.99 # User time : 0.014 s
% 7.27/1.99 # System time : 0.006 s
% 7.27/1.99 # Total time : 0.021 s
% 7.27/1.99 # Maximum resident set size: 7120 pages
% 7.27/1.99
%------------------------------------------------------------------------------