TSTP Solution File: ALG070+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG070+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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.76s 2.23s
% Output : CNFRefutation 7.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 15 unt; 0 nHn; 28 RR)
% Number of literals : 50 ( 22 equ; 24 neg)
% Maximal clause size : 4 ( 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 : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oztmrplf/input.p',i_0_12) ).
cnf(i_0_6,plain,
sorti2(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oztmrplf/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-oztmrplf/input.p',i_0_10) ).
cnf(i_0_7,plain,
sorti2(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oztmrplf/input.p',i_0_7) ).
cnf(i_0_9,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oztmrplf/input.p',i_0_9) ).
cnf(i_0_3,plain,
( op1(X1,X2) = X1
| op1(X1,X1) != X2
| ~ sorti1(X2)
| ~ sorti1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oztmrplf/input.p',i_0_3) ).
cnf(i_0_5,plain,
op2(esk1_0,esk1_0) = esk2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oztmrplf/input.p',i_0_5) ).
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-oztmrplf/input.p',i_0_11) ).
cnf(i_0_4,plain,
op2(esk1_0,esk2_0) != esk1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oztmrplf/input.p',i_0_4) ).
cnf(c_0_22,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
i_0_12 ).
cnf(c_0_23,plain,
sorti2(esk2_0),
i_0_6 ).
cnf(c_0_24,negated_conjecture,
( op1(j(X1),j(X2)) = j(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
i_0_10 ).
cnf(c_0_25,plain,
sorti2(esk1_0),
i_0_7 ).
cnf(c_0_26,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
i_0_9 ).
cnf(c_0_27,plain,
( op1(X1,X2) = X1
| op1(X1,X1) != X2
| ~ sorti1(X2)
| ~ sorti1(X1) ),
i_0_3 ).
cnf(c_0_28,plain,
sorti1(j(esk2_0)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( op1(j(X1),j(esk1_0)) = j(op2(X1,esk1_0))
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
op2(esk1_0,esk1_0) = esk2_0,
i_0_5 ).
cnf(c_0_31,negated_conjecture,
( op2(h(X1),h(X2)) = h(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
i_0_11 ).
cnf(c_0_32,plain,
h(j(esk2_0)) = esk2_0,
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_33,plain,
( op1(X1,j(esk2_0)) = X1
| op1(X1,X1) != j(esk2_0)
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
sorti1(j(esk1_0)),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_35,plain,
op1(j(esk1_0),j(esk1_0)) = j(esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_30]) ).
cnf(c_0_36,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_31,c_0_28]),c_0_32]) ).
cnf(c_0_37,plain,
op1(j(esk1_0),j(esk2_0)) = j(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_38,plain,
h(j(esk1_0)) = esk1_0,
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_39,plain,
op2(esk1_0,esk2_0) != esk1_0,
i_0_4 ).
cnf(c_0_40,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_36,c_0_37]),c_0_38]),c_0_38]),c_0_34])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ALG070+1 : TPTP v8.1.0. Released v2.7.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 22:12:33 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.76/2.23 # ENIGMATIC: Solved by autoschedule:
% 7.76/2.23 # No SInE strategy applied
% 7.76/2.23 # Trying AutoSched0 for 150 seconds
% 7.76/2.23 # AutoSched0-Mode selected heuristic G_E___107_C00_02_nc_F1_PI_AE_Q4_CS_SP_PS_S00EN
% 7.76/2.23 # and selection function PSelectSmallestOrientable.
% 7.76/2.23 #
% 7.76/2.23 # Preprocessing time : 0.012 s
% 7.76/2.23 # Presaturation interreduction done
% 7.76/2.23
% 7.76/2.23 # Proof found!
% 7.76/2.23 # SZS status Theorem
% 7.76/2.23 # SZS output start CNFRefutation
% See solution above
% 7.76/2.23 # Training examples: 0 positive, 0 negative
% 7.76/2.23
% 7.76/2.23 # -------------------------------------------------
% 7.76/2.23 # User time : 0.016 s
% 7.76/2.23 # System time : 0.002 s
% 7.76/2.23 # Total time : 0.018 s
% 7.76/2.23 # Maximum resident set size: 7120 pages
% 7.76/2.23
%------------------------------------------------------------------------------