TSTP Solution File: ALG073+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG073+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 14:51:36 EDT 2022
% Result : Theorem 4.90s 2.31s
% Output : CNFRefutation 4.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 32 ( 18 unt; 0 nHn; 32 RR)
% Number of literals : 58 ( 29 equ; 28 neg)
% Maximal clause size : 5 ( 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 : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,negated_conjecture,
( op2(h(X1),h(X2)) = h(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0jbichf0/input.p',i_0_12) ).
cnf(i_0_6,plain,
sorti1(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0jbichf0/input.p',i_0_6) ).
cnf(i_0_14,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0jbichf0/input.p',i_0_14) ).
cnf(i_0_4,plain,
op1(esk2_0,esk2_0) = esk1_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0jbichf0/input.p',i_0_4) ).
cnf(i_0_7,plain,
sorti1(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0jbichf0/input.p',i_0_7) ).
cnf(i_0_9,negated_conjecture,
( j(h(X1)) = X1
| ~ sorti1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0jbichf0/input.p',i_0_9) ).
cnf(i_0_8,plain,
( op2(X1,X2) = X1
| op2(X2,X2) != X1
| op2(X1,X1) != X2
| ~ sorti2(X2)
| ~ sorti2(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0jbichf0/input.p',i_0_8) ).
cnf(i_0_5,plain,
op1(esk1_0,esk1_0) = esk2_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0jbichf0/input.p',i_0_5) ).
cnf(i_0_11,negated_conjecture,
( op1(j(X1),j(X2)) = j(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0jbichf0/input.p',i_0_11) ).
cnf(i_0_3,plain,
op1(esk1_0,esk2_0) != esk1_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0jbichf0/input.p',i_0_3) ).
cnf(c_0_25,negated_conjecture,
( op2(h(X1),h(X2)) = h(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
i_0_12 ).
cnf(c_0_26,plain,
sorti1(esk2_0),
i_0_6 ).
cnf(c_0_27,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
i_0_14 ).
cnf(c_0_28,plain,
( op2(h(X1),h(esk2_0)) = h(op1(X1,esk2_0))
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
op1(esk2_0,esk2_0) = esk1_0,
i_0_4 ).
cnf(c_0_30,plain,
sorti1(esk1_0),
i_0_7 ).
cnf(c_0_31,negated_conjecture,
( j(h(X1)) = X1
| ~ sorti1(X1) ),
i_0_9 ).
cnf(c_0_32,plain,
( op2(X1,X2) = X1
| op2(X2,X2) != X1
| op2(X1,X1) != X2
| ~ sorti2(X2)
| ~ sorti2(X1) ),
i_0_8 ).
cnf(c_0_33,plain,
sorti2(h(esk2_0)),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_34,plain,
op2(h(esk2_0),h(esk2_0)) = h(esk1_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_26]),c_0_29]) ).
cnf(c_0_35,plain,
( op2(h(X1),h(esk1_0)) = h(op1(X1,esk1_0))
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_36,plain,
op1(esk1_0,esk1_0) = esk2_0,
i_0_5 ).
cnf(c_0_37,negated_conjecture,
( op1(j(X1),j(X2)) = j(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
i_0_11 ).
cnf(c_0_38,plain,
j(h(esk2_0)) = esk2_0,
inference(spm,[status(thm)],[c_0_31,c_0_26]) ).
cnf(c_0_39,plain,
( op2(X1,h(esk2_0)) = X1
| op2(X1,X1) != h(esk2_0)
| h(esk1_0) != X1
| ~ sorti2(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_40,plain,
sorti2(h(esk1_0)),
inference(spm,[status(thm)],[c_0_27,c_0_30]) ).
cnf(c_0_41,plain,
op2(h(esk1_0),h(esk1_0)) = h(esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_30]),c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( j(op2(X1,h(esk2_0))) = op1(j(X1),esk2_0)
| ~ sorti2(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_33]),c_0_38]) ).
cnf(c_0_43,plain,
op2(h(esk1_0),h(esk2_0)) = h(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_44,plain,
j(h(esk1_0)) = esk1_0,
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_45,plain,
op1(esk1_0,esk2_0) != esk1_0,
i_0_3 ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_44]),c_0_40])]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : ALG073+1 : TPTP v8.1.0. Released v2.7.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 8 06:02:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 4.90/2.31 # ENIGMATIC: Solved by autoschedule:
% 4.90/2.31 # No SInE strategy applied
% 4.90/2.31 # Trying AutoSched0 for 150 seconds
% 4.90/2.31 # AutoSched0-Mode selected heuristic G_E___107_C00_02_nc_F1_PI_AE_Q4_CS_SP_PS_S00EN
% 4.90/2.31 # and selection function PSelectSmallestOrientable.
% 4.90/2.31 #
% 4.90/2.31 # Preprocessing time : 0.014 s
% 4.90/2.31 # Presaturation interreduction done
% 4.90/2.31
% 4.90/2.31 # Proof found!
% 4.90/2.31 # SZS status Theorem
% 4.90/2.31 # SZS output start CNFRefutation
% See solution above
% 4.90/2.31 # Training examples: 0 positive, 0 negative
% 4.90/2.31
% 4.90/2.31 # -------------------------------------------------
% 4.90/2.31 # User time : 0.019 s
% 4.90/2.31 # System time : 0.005 s
% 4.90/2.31 # Total time : 0.023 s
% 4.90/2.31 # Maximum resident set size: 7120 pages
% 4.90/2.31
%------------------------------------------------------------------------------