TSTP Solution File: NUM845+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM845+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:32 EDT 2022
% Result : Theorem 4.27s 2.06s
% Output : CNFRefutation 4.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 6 RR)
% Number of literals : 15 ( 14 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_16,plain,
vplus(vmul(X1,X2),X1) = vmul(X1,vplus(X2,v1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8qrkshbb/input.p',i_0_16) ).
cnf(i_0_59,plain,
vplus(X1,X2) = vplus(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8qrkshbb/input.p',i_0_59) ).
cnf(i_0_2,negated_conjecture,
vplus(vmul(vd411,esk1_0),esk1_0) = vmul(vplus(vd411,v1),esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8qrkshbb/input.p',i_0_2) ).
cnf(i_0_62,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8qrkshbb/input.p',i_0_62) ).
cnf(i_0_1,negated_conjecture,
vplus(vmul(vd411,vplus(esk1_0,v1)),vplus(esk1_0,v1)) != vmul(vplus(vd411,v1),vplus(esk1_0,v1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8qrkshbb/input.p',i_0_1) ).
cnf(c_0_68,plain,
vplus(vmul(X1,X2),X1) = vmul(X1,vplus(X2,v1)),
i_0_16 ).
cnf(c_0_69,plain,
vplus(X1,X2) = vplus(X2,X1),
i_0_59 ).
cnf(c_0_70,negated_conjecture,
vplus(vmul(vd411,esk1_0),esk1_0) = vmul(vplus(vd411,v1),esk1_0),
i_0_2 ).
cnf(c_0_71,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
i_0_62 ).
cnf(c_0_72,negated_conjecture,
vplus(vmul(vd411,vplus(esk1_0,v1)),vplus(esk1_0,v1)) != vmul(vplus(vd411,v1),vplus(esk1_0,v1)),
i_0_1 ).
cnf(c_0_73,plain,
vmul(X1,vplus(X2,v1)) = vplus(X1,vmul(X1,X2)),
inference(rw,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_74,negated_conjecture,
vmul(vplus(vd411,v1),esk1_0) = vplus(esk1_0,vmul(vd411,esk1_0)),
inference(rw,[status(thm)],[c_0_70,c_0_69]) ).
cnf(c_0_75,plain,
vplus(X1,X2) = vplus(X2,X1),
c_0_69 ).
cnf(c_0_76,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
c_0_71 ).
cnf(c_0_77,negated_conjecture,
$false,
inference(ar,[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)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_74]),c_0_71]),c_0_73]),c_0_71]),c_0_69]),c_0_71]),c_0_75,c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM845+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jul 5 07:30:24 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.27/2.06 # ENIGMATIC: Solved by autoschedule:
% 4.27/2.06 # No SInE strategy applied
% 4.27/2.06 # Trying AutoSched0 for 150 seconds
% 4.27/2.06 # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 4.27/2.06 # and selection function SelectNewComplexAHP.
% 4.27/2.06 #
% 4.27/2.06 # Preprocessing time : 0.012 s
% 4.27/2.06
% 4.27/2.06 # Proof found!
% 4.27/2.06 # SZS status Theorem
% 4.27/2.06 # SZS output start CNFRefutation
% See solution above
% 4.27/2.06 # Training examples: 0 positive, 0 negative
% 4.27/2.06
% 4.27/2.06 # -------------------------------------------------
% 4.27/2.06 # User time : 0.016 s
% 4.27/2.06 # System time : 0.001 s
% 4.27/2.06 # Total time : 0.017 s
% 4.27/2.06 # Maximum resident set size: 7124 pages
% 4.27/2.06
%------------------------------------------------------------------------------