%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM836+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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 : Mon Jul 18 08:40:27 EDT 2022
% Result : Theorem 6.65s 2.21s
% Output : CNFRefutation 6.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 17 unt; 0 nHn; 17 RR)
% Number of literals : 25 ( 16 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
vplus(X1,X2) != X2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m4m09a67/input.p',i_0_13) ).
cnf(i_0_17,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m4m09a67/input.p',i_0_17) ).
cnf(i_0_14,plain,
vplus(X1,X2) = vplus(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m4m09a67/input.p',i_0_14) ).
cnf(i_0_7,plain,
( vplus(X1,esk2_2(X1,X2)) = X2
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m4m09a67/input.p',i_0_7) ).
cnf(i_0_2,negated_conjecture,
greater(vd203,vd204),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m4m09a67/input.p',i_0_2) ).
cnf(i_0_5,plain,
( vplus(X1,esk1_2(X2,X1)) = X2
| ~ less(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m4m09a67/input.p',i_0_5) ).
cnf(i_0_1,negated_conjecture,
less(vd203,vd204),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m4m09a67/input.p',i_0_1) ).
cnf(c_0_25,plain,
vplus(X1,X2) != X2,
i_0_13 ).
cnf(c_0_26,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
i_0_17 ).
cnf(c_0_27,plain,
vplus(X1,vplus(X2,X3)) != X3,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
vplus(X1,X2) = vplus(X2,X1),
i_0_14 ).
cnf(c_0_29,plain,
( vplus(X1,esk2_2(X1,X2)) = X2
| ~ greater(X2,X1) ),
i_0_7 ).
cnf(c_0_30,negated_conjecture,
greater(vd203,vd204),
i_0_2 ).
cnf(c_0_31,plain,
vplus(X1,vplus(X2,X3)) != X2,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
vplus(vd204,esk2_2(vd204,vd203)) = vd203,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( vplus(X1,esk1_2(X2,X1)) = X2
| ~ less(X1,X2) ),
i_0_5 ).
cnf(c_0_34,negated_conjecture,
less(vd203,vd204),
i_0_1 ).
cnf(c_0_35,negated_conjecture,
vplus(X1,vd203) != vd204,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
vplus(vd203,esk1_2(vd204,vd203)) = vd204,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
vplus(vd203,X1) != vd204,
inference(spm,[status(thm)],[c_0_35,c_0_28]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_36,c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM836+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.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 : Tue Jul 5 08:22:01 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 6.65/2.21 # ENIGMATIC: Solved by autoschedule:
% 6.65/2.21 # No SInE strategy applied
% 6.65/2.21 # Trying AutoSched0 for 150 seconds
% 6.65/2.21 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 6.65/2.21 # and selection function SelectNewComplexAHP.
% 6.65/2.21 #
% 6.65/2.21 # Preprocessing time : 0.012 s
% 6.65/2.21 # Presaturation interreduction done
% 6.65/2.21
% 6.65/2.21 # Proof found!
% 6.65/2.21 # SZS status Theorem
% 6.65/2.21 # SZS output start CNFRefutation
% See solution above
% 6.65/2.21 # Training examples: 0 positive, 0 negative
% 6.65/2.21
% 6.65/2.21 # -------------------------------------------------
% 6.65/2.21 # User time : 0.016 s
% 6.65/2.21 # System time : 0.004 s
% 6.65/2.21 # Total time : 0.020 s
% 6.65/2.21 # Maximum resident set size: 7124 pages
% 6.65/2.21
%------------------------------------------------------------------------------