TSTP Solution File: ALG074+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG074+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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 10.26s 2.59s
% Output : CNFRefutation 10.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of clauses : 42 ( 16 unt; 9 nHn; 42 RR)
% Number of literals : 87 ( 38 equ; 40 neg)
% Maximal clause size : 5 ( 2 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 : 26 ( 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-mow5easo/input.p',i_0_12) ).
cnf(i_0_4,plain,
op1(op1(esk1_0,esk2_0),esk2_0) = esk1_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mow5easo/input.p',i_0_4) ).
cnf(i_0_6,plain,
sorti1(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mow5easo/input.p',i_0_6) ).
cnf(i_0_1,plain,
( sorti1(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mow5easo/input.p',i_0_1) ).
cnf(i_0_7,plain,
sorti1(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mow5easo/input.p',i_0_7) ).
cnf(i_0_2,plain,
( sorti2(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mow5easo/input.p',i_0_2) ).
cnf(i_0_14,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mow5easo/input.p',i_0_14) ).
cnf(i_0_8,plain,
( op2(X1,X2) = op2(X2,X1)
| op2(op2(X1,X2),X1) = X2
| op2(op2(X1,X2),X2) != X1
| ~ sorti2(X2)
| ~ sorti2(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mow5easo/input.p',i_0_8) ).
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-mow5easo/input.p',i_0_11) ).
cnf(i_0_9,negated_conjecture,
( j(h(X1)) = X1
| ~ sorti1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mow5easo/input.p',i_0_9) ).
cnf(i_0_3,plain,
op1(op1(esk1_0,esk2_0),esk1_0) != esk2_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mow5easo/input.p',i_0_3) ).
cnf(i_0_5,plain,
op1(esk1_0,esk2_0) != op1(esk2_0,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mow5easo/input.p',i_0_5) ).
cnf(c_0_27,negated_conjecture,
( op2(h(X1),h(X2)) = h(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
i_0_12 ).
cnf(c_0_28,plain,
op1(op1(esk1_0,esk2_0),esk2_0) = esk1_0,
i_0_4 ).
cnf(c_0_29,plain,
sorti1(esk2_0),
i_0_6 ).
cnf(c_0_30,plain,
( op2(h(op1(esk1_0,esk2_0)),h(esk2_0)) = h(esk1_0)
| ~ sorti1(op1(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_31,plain,
( sorti1(op1(X1,X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
i_0_1 ).
cnf(c_0_32,plain,
sorti1(esk1_0),
i_0_7 ).
cnf(c_0_33,plain,
( sorti2(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
i_0_2 ).
cnf(c_0_34,plain,
op2(h(op1(esk1_0,esk2_0)),h(esk2_0)) = h(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29]),c_0_32])]) ).
cnf(c_0_35,plain,
( sorti2(h(esk1_0))
| ~ sorti2(h(op1(esk1_0,esk2_0)))
| ~ sorti2(h(esk2_0)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
i_0_14 ).
cnf(c_0_37,negated_conjecture,
( sorti2(h(esk1_0))
| ~ sorti2(h(op1(esk1_0,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_29])]) ).
cnf(c_0_38,negated_conjecture,
( sorti2(h(esk1_0))
| ~ sorti1(op1(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_39,plain,
( op2(X1,X2) = op2(X2,X1)
| op2(op2(X1,X2),X1) = X2
| op2(op2(X1,X2),X2) != X1
| ~ sorti2(X2)
| ~ sorti2(X1) ),
i_0_8 ).
cnf(c_0_40,negated_conjecture,
op2(op2(h(esk1_0),h(esk2_0)),h(esk2_0)) = h(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_29]),c_0_32])]) ).
cnf(c_0_41,plain,
sorti2(h(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_31]),c_0_29]),c_0_32])]) ).
cnf(c_0_42,plain,
( op2(h(esk1_0),h(esk2_0)) = op2(h(esk2_0),h(esk1_0))
| op2(op2(h(esk1_0),h(esk2_0)),h(esk1_0)) = h(esk2_0)
| ~ sorti2(h(esk2_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_43,negated_conjecture,
( op1(j(X1),j(X2)) = j(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
i_0_11 ).
cnf(c_0_44,negated_conjecture,
( op2(op2(h(esk1_0),h(esk2_0)),h(esk1_0)) = h(esk2_0)
| op2(h(esk1_0),h(esk2_0)) = op2(h(esk2_0),h(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_29])]) ).
cnf(c_0_45,negated_conjecture,
( op1(j(op2(h(esk1_0),h(esk2_0))),j(h(esk1_0))) = j(h(esk2_0))
| op2(h(esk1_0),h(esk2_0)) = op2(h(esk2_0),h(esk1_0))
| ~ sorti2(op2(h(esk1_0),h(esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_41])]) ).
cnf(c_0_46,plain,
( op1(j(op2(h(esk1_0),h(esk2_0))),j(h(esk1_0))) = j(h(esk2_0))
| op2(h(esk1_0),h(esk2_0)) = op2(h(esk2_0),h(esk1_0))
| ~ sorti2(h(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_33]),c_0_41])]) ).
cnf(c_0_47,negated_conjecture,
( op1(j(op2(h(esk1_0),h(esk2_0))),j(h(esk1_0))) = j(h(esk2_0))
| op2(h(esk1_0),h(esk2_0)) = op2(h(esk2_0),h(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_36]),c_0_29])]) ).
cnf(c_0_48,negated_conjecture,
( j(h(X1)) = X1
| ~ sorti1(X1) ),
i_0_9 ).
cnf(c_0_49,negated_conjecture,
( op1(j(op2(h(esk1_0),h(esk2_0))),esk1_0) = j(h(esk2_0))
| op2(h(esk1_0),h(esk2_0)) = op2(h(esk2_0),h(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_32])]) ).
cnf(c_0_50,negated_conjecture,
( j(op2(h(X1),h(X2))) = op1(X1,X2)
| ~ sorti1(X2)
| ~ sorti1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_27]),c_0_31]) ).
cnf(c_0_51,negated_conjecture,
( op2(h(esk1_0),h(esk2_0)) = op2(h(esk2_0),h(esk1_0))
| j(h(esk2_0)) = op1(op1(esk1_0,esk2_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_29]),c_0_32])]) ).
cnf(c_0_52,plain,
op1(op1(esk1_0,esk2_0),esk1_0) != esk2_0,
i_0_3 ).
cnf(c_0_53,negated_conjecture,
op2(h(esk1_0),h(esk2_0)) = op2(h(esk2_0),h(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_51]),c_0_29])]),c_0_52]) ).
cnf(c_0_54,negated_conjecture,
j(op2(h(esk2_0),h(esk1_0))) = op1(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_53]),c_0_29]),c_0_32])]) ).
cnf(c_0_55,plain,
op1(esk1_0,esk2_0) != op1(esk2_0,esk1_0),
i_0_5 ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_54]),c_0_32]),c_0_29])]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : ALG074+1 : TPTP v8.1.0. Released v2.7.0.
% 0.02/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 04:24:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 10.26/2.59 # ENIGMATIC: Solved by autoschedule:
% 10.26/2.59 # No SInE strategy applied
% 10.26/2.59 # Trying AutoSched0 for 150 seconds
% 10.26/2.59 # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 10.26/2.59 # and selection function SelectNewComplexAHP.
% 10.26/2.59 #
% 10.26/2.59 # Preprocessing time : 0.023 s
% 10.26/2.59
% 10.26/2.59 # Proof found!
% 10.26/2.59 # SZS status Theorem
% 10.26/2.59 # SZS output start CNFRefutation
% See solution above
% 10.26/2.59 # Training examples: 0 positive, 0 negative
% 10.26/2.59
% 10.26/2.59 # -------------------------------------------------
% 10.26/2.59 # User time : 0.026 s
% 10.26/2.59 # System time : 0.004 s
% 10.26/2.59 # Total time : 0.030 s
% 10.26/2.59 # Maximum resident set size: 7124 pages
% 10.26/2.59
%------------------------------------------------------------------------------