%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM851+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:36 EDT 2022
% Result : Theorem 8.34s 2.42s
% Output : CNFRefutation 8.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 3 RR)
% Number of literals : 9 ( 8 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
vplus(vmul(vd471,vd469),vmul(vd473,vd469)) != vmul(vplus(vd471,vd473),vd469),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-59fbc635/input.p',i_0_1) ).
cnf(i_0_22,plain,
vplus(X1,X2) = vplus(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-59fbc635/input.p',i_0_22) ).
cnf(i_0_7,plain,
vmul(X1,X2) = vmul(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-59fbc635/input.p',i_0_7) ).
cnf(i_0_6,plain,
vplus(vmul(X1,X2),vmul(X1,X3)) = vmul(X1,vplus(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-59fbc635/input.p',i_0_6) ).
cnf(c_0_27,negated_conjecture,
vplus(vmul(vd471,vd469),vmul(vd473,vd469)) != vmul(vplus(vd471,vd473),vd469),
i_0_1 ).
cnf(c_0_28,plain,
vplus(X1,X2) = vplus(X2,X1),
i_0_22 ).
cnf(c_0_29,plain,
vmul(X1,X2) = vmul(X2,X1),
i_0_7 ).
cnf(c_0_30,plain,
vplus(vmul(X1,X2),vmul(X1,X3)) = vmul(X1,vplus(X2,X3)),
i_0_6 ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]),c_0_29]),c_0_29]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM851+2 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n020.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 Jul 5 14:11:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.34/2.42 # ENIGMATIC: Solved by autoschedule:
% 8.34/2.42 # No SInE strategy applied
% 8.34/2.42 # Trying AutoSched0 for 150 seconds
% 8.34/2.42 # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 8.34/2.42 # and selection function SelectNewComplexAHP.
% 8.34/2.42 #
% 8.34/2.42 # Preprocessing time : 0.023 s
% 8.34/2.42
% 8.34/2.42 # Proof found!
% 8.34/2.42 # SZS status Theorem
% 8.34/2.42 # SZS output start CNFRefutation
% See solution above
% 8.34/2.42 # Training examples: 0 positive, 0 negative
% 8.34/2.42
% 8.34/2.42 # -------------------------------------------------
% 8.34/2.42 # User time : 0.028 s
% 8.34/2.42 # System time : 0.005 s
% 8.34/2.42 # Total time : 0.033 s
% 8.34/2.42 # Maximum resident set size: 7116 pages
% 8.34/2.42
%------------------------------------------------------------------------------