TSTP Solution File: ALG201+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG201+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:58 EDT 2022
% Result : Theorem 7.46s 2.59s
% Output : CNFRefutation 7.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 5 unt; 0 nHn; 12 RR)
% Number of literals : 21 ( 7 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( op1(X1,X1) != X1
| ~ sorti1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke99x6sb/input.p',i_0_3) ).
cnf(i_0_8,negated_conjecture,
( op1(j(X1),j(X2)) = j(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke99x6sb/input.p',i_0_8) ).
cnf(i_0_10,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke99x6sb/input.p',i_0_10) ).
cnf(i_0_4,plain,
op2(esk1_0,esk1_0) = esk1_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke99x6sb/input.p',i_0_4) ).
cnf(i_0_5,plain,
sorti2(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke99x6sb/input.p',i_0_5) ).
cnf(c_0_16,plain,
( op1(X1,X1) != X1
| ~ sorti1(X1) ),
i_0_3 ).
cnf(c_0_17,negated_conjecture,
( op1(j(X1),j(X2)) = j(op2(X1,X2))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
i_0_8 ).
cnf(c_0_18,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
i_0_10 ).
cnf(c_0_19,plain,
( j(op2(X1,X1)) != j(X1)
| ~ sorti2(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,plain,
op2(esk1_0,esk1_0) = esk1_0,
i_0_4 ).
cnf(c_0_21,plain,
sorti2(esk1_0),
i_0_5 ).
cnf(c_0_22,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ALG201+1 : TPTP v8.1.0. Released v2.7.0.
% 0.06/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Wed Jun 8 11:11:06 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.46/2.59 # ENIGMATIC: Solved by autoschedule:
% 7.46/2.59 # No SInE strategy applied
% 7.46/2.59 # Trying AutoSched0 for 150 seconds
% 7.46/2.59 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 7.46/2.59 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.46/2.59 #
% 7.46/2.59 # Preprocessing time : 0.023 s
% 7.46/2.59 # Presaturation interreduction done
% 7.46/2.59
% 7.46/2.59 # Proof found!
% 7.46/2.59 # SZS status Theorem
% 7.46/2.59 # SZS output start CNFRefutation
% See solution above
% 7.46/2.59 # Training examples: 0 positive, 0 negative
% 7.46/2.59
% 7.46/2.59 # -------------------------------------------------
% 7.46/2.59 # User time : 0.022 s
% 7.46/2.59 # System time : 0.005 s
% 7.46/2.59 # Total time : 0.027 s
% 7.46/2.59 # Maximum resident set size: 7120 pages
% 7.46/2.59
%------------------------------------------------------------------------------