TSTP Solution File: ALG178+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG178+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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 15:32:43 EDT 2022
% Result : Theorem 8.41s 2.47s
% Output : CNFRefutation 8.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 9 unt; 0 nHn; 24 RR)
% Number of literals : 47 ( 14 equ; 31 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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_8,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y65po7ko/input.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-y65po7ko/input.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-y65po7ko/input.p',i_0_2) ).
cnf(i_0_4,plain,
op2(esk1_0,op2(esk1_0,esk2_0)) != esk2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y65po7ko/input.p',i_0_4) ).
cnf(i_0_6,plain,
sorti2(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y65po7ko/input.p',i_0_6) ).
cnf(i_0_5,plain,
sorti2(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y65po7ko/input.p',i_0_5) ).
cnf(i_0_3,plain,
( op1(X1,op1(X1,X2)) = X2
| ~ sorti1(X2)
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y65po7ko/input.p',i_0_3) ).
cnf(i_0_11,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y65po7ko/input.p',i_0_11) ).
cnf(c_0_20,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
i_0_8 ).
cnf(c_0_21,negated_conjecture,
( op1(j(X1),j(X2)) = j(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
i_0_9 ).
cnf(c_0_22,plain,
( sorti2(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
i_0_2 ).
cnf(c_0_23,plain,
op2(esk1_0,op2(esk1_0,esk2_0)) != esk2_0,
i_0_4 ).
cnf(c_0_24,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_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
sorti2(esk1_0),
i_0_6 ).
cnf(c_0_26,plain,
( h(op1(j(esk1_0),j(op2(esk1_0,esk2_0)))) != esk2_0
| ~ sorti2(op2(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_27,plain,
sorti2(esk2_0),
i_0_5 ).
cnf(c_0_28,negated_conjecture,
( h(op1(j(esk1_0),op1(j(esk1_0),j(esk2_0)))) != esk2_0
| ~ sorti2(op2(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_21]),c_0_27]),c_0_25])]) ).
cnf(c_0_29,plain,
h(op1(j(esk1_0),op1(j(esk1_0),j(esk2_0)))) != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_22]),c_0_27]),c_0_25])]) ).
cnf(c_0_30,plain,
( op1(X1,op1(X1,X2)) = X2
| ~ sorti1(X2)
| ~ sorti1(X1) ),
i_0_3 ).
cnf(c_0_31,plain,
( h(j(esk2_0)) != esk2_0
| ~ sorti1(j(esk2_0))
| ~ sorti1(j(esk1_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
i_0_11 ).
cnf(c_0_33,negated_conjecture,
( h(j(esk2_0)) != esk2_0
| ~ sorti1(j(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_25])]) ).
cnf(c_0_34,negated_conjecture,
~ sorti1(j(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_20]),c_0_27])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_32]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : ALG178+1 : TPTP v8.1.0. Released v2.7.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jun 8 14:25:38 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected complete mode:
% 8.41/2.47 # ENIGMATIC: Solved by autoschedule:
% 8.41/2.47 # No SInE strategy applied
% 8.41/2.47 # Trying AutoSched0 for 150 seconds
% 8.41/2.47 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 8.41/2.47 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.41/2.47 #
% 8.41/2.47 # Preprocessing time : 0.016 s
% 8.41/2.47 # Presaturation interreduction done
% 8.41/2.47
% 8.41/2.47 # Proof found!
% 8.41/2.47 # SZS status Theorem
% 8.41/2.47 # SZS output start CNFRefutation
% See solution above
% 8.41/2.47 # Training examples: 0 positive, 0 negative
% 8.41/2.47
% 8.41/2.47 # -------------------------------------------------
% 8.41/2.47 # User time : 0.017 s
% 8.41/2.47 # System time : 0.006 s
% 8.41/2.47 # Total time : 0.022 s
% 8.41/2.47 # Maximum resident set size: 7120 pages
% 8.41/2.47
%------------------------------------------------------------------------------