TSTP Solution File: ALG071+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG071+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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 7.53s 2.43s
% Output : CNFRefutation 7.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 46 ( 17 unt; 0 nHn; 46 RR)
% Number of literals : 85 ( 29 equ; 42 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 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 : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lilcnqag/input.p',i_0_12) ).
cnf(i_0_7,plain,
sorti2(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lilcnqag/input.p',i_0_7) ).
cnf(i_0_1,plain,
( sorti1(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lilcnqag/input.p',i_0_1) ).
cnf(i_0_5,plain,
( sorti1(esk1_1(X1))
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lilcnqag/input.p',i_0_5) ).
cnf(i_0_9,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lilcnqag/input.p',i_0_9) ).
cnf(i_0_3,plain,
( op1(X1,op1(esk1_1(X1),X1)) = esk1_1(X1)
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lilcnqag/input.p',i_0_3) ).
cnf(i_0_11,negated_conjecture,
( op2(h(X1),h(X2)) = h(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lilcnqag/input.p',i_0_11) ).
cnf(i_0_13,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lilcnqag/input.p',i_0_13) ).
cnf(i_0_6,plain,
( op2(X1,op2(X1,esk2_0)) = esk2_0
| op2(esk2_0,op2(X1,esk2_0)) != X1
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lilcnqag/input.p',i_0_6) ).
cnf(i_0_10,negated_conjecture,
( op1(j(X1),j(X2)) = j(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lilcnqag/input.p',i_0_10) ).
cnf(i_0_8,negated_conjecture,
( j(h(X1)) = X1
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lilcnqag/input.p',i_0_8) ).
cnf(i_0_2,plain,
( sorti2(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lilcnqag/input.p',i_0_2) ).
cnf(i_0_4,plain,
( op1(esk1_1(X1),op1(esk1_1(X1),X1)) != X1
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lilcnqag/input.p',i_0_4) ).
cnf(c_0_27,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
i_0_12 ).
cnf(c_0_28,plain,
sorti2(esk2_0),
i_0_7 ).
cnf(c_0_29,plain,
( sorti1(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
i_0_1 ).
cnf(c_0_30,plain,
sorti1(j(esk2_0)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( sorti1(esk1_1(X1))
| ~ sorti1(X1) ),
i_0_5 ).
cnf(c_0_32,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
i_0_9 ).
cnf(c_0_33,plain,
( op1(X1,op1(esk1_1(X1),X1)) = esk1_1(X1)
| ~ sorti1(X1) ),
i_0_3 ).
cnf(c_0_34,plain,
( sorti1(op1(X1,j(esk2_0)))
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
sorti1(esk1_1(j(esk2_0))),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( op2(h(X1),h(X2)) = h(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
i_0_11 ).
cnf(c_0_37,plain,
h(j(esk2_0)) = esk2_0,
inference(spm,[status(thm)],[c_0_32,c_0_28]) ).
cnf(c_0_38,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
i_0_13 ).
cnf(c_0_39,plain,
op1(j(esk2_0),op1(esk1_1(j(esk2_0)),j(esk2_0))) = esk1_1(j(esk2_0)),
inference(spm,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_40,plain,
sorti1(op1(esk1_1(j(esk2_0)),j(esk2_0))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( h(op1(X1,j(esk2_0))) = op2(h(X1),esk2_0)
| ~ sorti1(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_37]) ).
cnf(c_0_42,plain,
( op2(X1,op2(X1,esk2_0)) = esk2_0
| op2(esk2_0,op2(X1,esk2_0)) != X1
| ~ sorti2(X1) ),
i_0_6 ).
cnf(c_0_43,negated_conjecture,
sorti2(h(esk1_1(j(esk2_0)))),
inference(spm,[status(thm)],[c_0_38,c_0_35]) ).
cnf(c_0_44,negated_conjecture,
op2(esk2_0,h(op1(esk1_1(j(esk2_0)),j(esk2_0)))) = h(esk1_1(j(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_39]),c_0_37]),c_0_30])]),c_0_40])]) ).
cnf(c_0_45,plain,
h(op1(esk1_1(j(esk2_0)),j(esk2_0))) = op2(h(esk1_1(j(esk2_0))),esk2_0),
inference(spm,[status(thm)],[c_0_41,c_0_35]) ).
cnf(c_0_46,negated_conjecture,
( op1(j(X1),j(X2)) = j(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
i_0_10 ).
cnf(c_0_47,negated_conjecture,
( j(h(X1)) = X1
| ~ sorti1(X1) ),
i_0_8 ).
cnf(c_0_48,plain,
( sorti2(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
i_0_2 ).
cnf(c_0_49,plain,
( op2(h(esk1_1(j(esk2_0))),op2(h(esk1_1(j(esk2_0))),esk2_0)) = esk2_0
| op2(esk2_0,op2(h(esk1_1(j(esk2_0))),esk2_0)) != h(esk1_1(j(esk2_0))) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
op2(esk2_0,op2(h(esk1_1(j(esk2_0))),esk2_0)) = h(esk1_1(j(esk2_0))),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
( j(op2(X1,esk2_0)) = op1(j(X1),j(esk2_0))
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_28]) ).
cnf(c_0_52,negated_conjecture,
j(h(esk1_1(j(esk2_0)))) = esk1_1(j(esk2_0)),
inference(spm,[status(thm)],[c_0_47,c_0_35]) ).
cnf(c_0_53,plain,
( sorti2(op2(X1,esk2_0))
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_28]) ).
cnf(c_0_54,plain,
( op1(esk1_1(X1),op1(esk1_1(X1),X1)) != X1
| ~ sorti1(X1) ),
i_0_4 ).
cnf(c_0_55,plain,
op2(h(esk1_1(j(esk2_0))),op2(h(esk1_1(j(esk2_0))),esk2_0)) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_56,negated_conjecture,
j(op2(h(esk1_1(j(esk2_0))),esk2_0)) = op1(esk1_1(j(esk2_0)),j(esk2_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_43]),c_0_52]) ).
cnf(c_0_57,plain,
sorti2(op2(h(esk1_1(j(esk2_0))),esk2_0)),
inference(spm,[status(thm)],[c_0_53,c_0_43]) ).
cnf(c_0_58,plain,
op1(esk1_1(j(esk2_0)),op1(esk1_1(j(esk2_0)),j(esk2_0))) != j(esk2_0),
inference(spm,[status(thm)],[c_0_54,c_0_30]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_55]),c_0_52]),c_0_56]),c_0_57]),c_0_43])]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG071+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n025.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 05:19:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.53/2.43 # ENIGMATIC: Solved by autoschedule:
% 7.53/2.43 # No SInE strategy applied
% 7.53/2.43 # Trying AutoSched0 for 150 seconds
% 7.53/2.43 # AutoSched0-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S00EN
% 7.53/2.43 # and selection function PSelectSmallestOrientable.
% 7.53/2.43 #
% 7.53/2.43 # Preprocessing time : 0.023 s
% 7.53/2.43 # Presaturation interreduction done
% 7.53/2.43
% 7.53/2.43 # Proof found!
% 7.53/2.43 # SZS status Theorem
% 7.53/2.43 # SZS output start CNFRefutation
% See solution above
% 7.53/2.43 # Training examples: 0 positive, 0 negative
% 7.53/2.43
% 7.53/2.43 # -------------------------------------------------
% 7.53/2.43 # User time : 0.049 s
% 7.53/2.43 # System time : 0.006 s
% 7.53/2.43 # Total time : 0.055 s
% 7.53/2.43 # Maximum resident set size: 7116 pages
% 7.53/2.43
%------------------------------------------------------------------------------