TSTP Solution File: NUM845+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM845+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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 7.26s 2.35s
% Output : CNFRefutation 7.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 21 unt; 0 nHn; 13 RR)
% Number of literals : 27 ( 26 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 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 : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/tmp/enigma-theBenchmark.p-q2chkogi/input.p',i_0_1) ).
cnf(i_0_15,plain,
vplus(v1,X1) = vplus(X1,v1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q2chkogi/input.p',i_0_15) ).
cnf(i_0_13,plain,
vplus(vmul(X1,X2),X1) = vmul(X1,vplus(X2,v1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q2chkogi/input.p',i_0_13) ).
cnf(i_0_14,plain,
vplus(X1,X2) = vplus(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q2chkogi/input.p',i_0_14) ).
cnf(i_0_16,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q2chkogi/input.p',i_0_16) ).
cnf(i_0_10,plain,
( vplus(vmul(vplus(vd411,v1),X1),vplus(vd411,v1)) = vmul(vplus(vd411,v1),vplus(X1,v1))
| vplus(vmul(vd411,X1),X1) != vmul(vplus(vd411,v1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q2chkogi/input.p',i_0_10) ).
cnf(i_0_2,negated_conjecture,
vplus(vmul(vd411,esk1_0),esk1_0) = vmul(vplus(vd411,v1),esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q2chkogi/input.p',i_0_2) ).
cnf(c_0_24,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_25,plain,
vplus(v1,X1) = vplus(X1,v1),
i_0_15 ).
cnf(c_0_26,plain,
vplus(vmul(X1,X2),X1) = vmul(X1,vplus(X2,v1)),
i_0_13 ).
cnf(c_0_27,plain,
vplus(X1,X2) = vplus(X2,X1),
i_0_14 ).
cnf(c_0_28,negated_conjecture,
vplus(vmul(vd411,vplus(v1,esk1_0)),vplus(v1,esk1_0)) != vmul(vplus(vd411,v1),vplus(v1,esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]),c_0_25]) ).
cnf(c_0_29,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
i_0_16 ).
cnf(c_0_30,plain,
vplus(X1,vmul(X1,X2)) = vmul(X1,vplus(X2,v1)),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( vplus(vmul(vplus(vd411,v1),X1),vplus(vd411,v1)) = vmul(vplus(vd411,v1),vplus(X1,v1))
| vplus(vmul(vd411,X1),X1) != vmul(vplus(vd411,v1),X1) ),
i_0_10 ).
cnf(c_0_32,negated_conjecture,
vplus(vmul(vd411,esk1_0),esk1_0) = vmul(vplus(vd411,v1),esk1_0),
i_0_2 ).
cnf(c_0_33,negated_conjecture,
vplus(v1,vplus(esk1_0,vmul(vd411,vplus(v1,esk1_0)))) != vmul(vplus(vd411,v1),vplus(v1,esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_27]),c_0_29]) ).
cnf(c_0_34,plain,
vplus(X1,vmul(X1,X2)) = vmul(X1,vplus(v1,X2)),
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_35,plain,
( vplus(vd411,vplus(v1,vmul(vplus(vd411,v1),X1))) = vmul(vplus(vd411,v1),vplus(X1,v1))
| vplus(X1,vmul(vd411,X1)) != vmul(vplus(vd411,v1),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_27]),c_0_29]),c_0_27]) ).
cnf(c_0_36,negated_conjecture,
vmul(vplus(vd411,v1),esk1_0) = vplus(esk1_0,vmul(vd411,esk1_0)),
inference(rw,[status(thm)],[c_0_32,c_0_27]) ).
cnf(c_0_37,negated_conjecture,
vplus(v1,vplus(esk1_0,vplus(vd411,vmul(vd411,esk1_0)))) != vmul(vplus(vd411,v1),vplus(v1,esk1_0)),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
vplus(X1,vplus(X2,X3)) = vplus(X3,vplus(X1,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_29]) ).
cnf(c_0_39,negated_conjecture,
vplus(vd411,vplus(v1,vplus(esk1_0,vmul(vd411,esk1_0)))) = vmul(vplus(vd411,v1),vplus(v1,esk1_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_25]) ).
cnf(c_0_40,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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_27]),c_0_38]),c_0_29]),c_0_27]),c_0_38]),c_0_27]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM845+2 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n008.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 Jul 7 03:29:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.26/2.35 # ENIGMATIC: Solved by autoschedule:
% 7.26/2.35 # No SInE strategy applied
% 7.26/2.35 # Trying AutoSched0 for 150 seconds
% 7.26/2.35 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02FN
% 7.26/2.35 # and selection function PSelectNonAntiRROptimalLit.
% 7.26/2.35 #
% 7.26/2.35 # Preprocessing time : 0.022 s
% 7.26/2.35 # Presaturation interreduction done
% 7.26/2.35
% 7.26/2.35 # Proof found!
% 7.26/2.35 # SZS status Theorem
% 7.26/2.35 # SZS output start CNFRefutation
% See solution above
% 7.26/2.35 # Training examples: 0 positive, 0 negative
% 7.26/2.35
% 7.26/2.35 # -------------------------------------------------
% 7.26/2.35 # User time : 0.024 s
% 7.26/2.35 # System time : 0.008 s
% 7.26/2.35 # Total time : 0.032 s
% 7.26/2.35 # Maximum resident set size: 7120 pages
% 7.26/2.35
%------------------------------------------------------------------------------