TSTP Solution File: NUM849+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM849+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:34 EDT 2022
% Result : Theorem 4.45s 2.26s
% Output : CNFRefutation 4.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 18 unt; 0 nHn; 11 RR)
% Number of literals : 24 ( 23 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
vplus(vmul(X1,X2),X2) = vmul(vplus(X1,v1),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6ea20y7h/lgb.p',i_0_10) ).
cnf(i_0_13,plain,
vplus(X1,X2) = vplus(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6ea20y7h/lgb.p',i_0_13) ).
cnf(i_0_2,negated_conjecture,
vmul(vmul(vd448,vd449),esk1_0) = vmul(vd448,vmul(vd449,esk1_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6ea20y7h/lgb.p',i_0_2) ).
cnf(i_0_9,plain,
vmul(X1,X2) = vmul(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6ea20y7h/lgb.p',i_0_9) ).
cnf(i_0_12,plain,
vplus(vmul(X1,X2),X1) = vmul(X1,vplus(X2,v1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6ea20y7h/lgb.p',i_0_12) ).
cnf(i_0_4,plain,
( vplus(vmul(vd448,vmul(vd449,X1)),vmul(vd448,vd449)) = vmul(vd448,vplus(vmul(vd449,X1),vd449))
| vmul(vmul(vd448,vd449),X1) != vmul(vd448,vmul(vd449,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6ea20y7h/lgb.p',i_0_4) ).
cnf(i_0_1,negated_conjecture,
vmul(vmul(vd448,vd449),vplus(esk1_0,v1)) != vmul(vd448,vmul(vd449,vplus(esk1_0,v1))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6ea20y7h/lgb.p',i_0_1) ).
cnf(c_0_21,plain,
vplus(vmul(X1,X2),X2) = vmul(vplus(X1,v1),X2),
i_0_10 ).
cnf(c_0_22,plain,
vplus(X1,X2) = vplus(X2,X1),
i_0_13 ).
cnf(c_0_23,negated_conjecture,
vmul(vmul(vd448,vd449),esk1_0) = vmul(vd448,vmul(vd449,esk1_0)),
i_0_2 ).
cnf(c_0_24,plain,
vmul(X1,X2) = vmul(X2,X1),
i_0_9 ).
cnf(c_0_25,plain,
vplus(vmul(X1,X2),X1) = vmul(X1,vplus(X2,v1)),
i_0_12 ).
cnf(c_0_26,plain,
vplus(X1,vmul(X2,X1)) = vmul(vplus(X2,v1),X1),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
vmul(esk1_0,vmul(vd449,vd448)) = vmul(vd448,vmul(vd449,esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_28,plain,
( vplus(vmul(vd448,vmul(vd449,X1)),vmul(vd448,vd449)) = vmul(vd448,vplus(vmul(vd449,X1),vd449))
| vmul(vmul(vd448,vd449),X1) != vmul(vd448,vmul(vd449,X1)) ),
i_0_4 ).
cnf(c_0_29,plain,
vplus(X1,vmul(X1,X2)) = vmul(X1,vplus(X2,v1)),
inference(rw,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_30,negated_conjecture,
vmul(vmul(vd448,vd449),vplus(esk1_0,v1)) != vmul(vd448,vmul(vd449,vplus(esk1_0,v1))),
i_0_1 ).
cnf(c_0_31,negated_conjecture,
vplus(vmul(vd449,vd448),vmul(vd448,vmul(vd449,esk1_0))) = vmul(vmul(vd449,vd448),vplus(v1,esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22]),c_0_24]) ).
cnf(c_0_32,plain,
( vplus(vmul(vd449,vd448),vmul(vd448,vmul(vd449,X1))) = vmul(vd448,vmul(vd449,vplus(X1,v1)))
| vmul(vmul(vd449,vd448),X1) != vmul(vd448,vmul(vd449,X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_24]),c_0_22]),c_0_22]),c_0_29]),c_0_24]) ).
cnf(c_0_33,negated_conjecture,
vmul(vmul(vd449,vd448),vplus(v1,esk1_0)) != vmul(vd448,vmul(vd449,vplus(v1,esk1_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_24]),c_0_22]),c_0_22]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_22]),c_0_33]),c_0_24]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUM849+2 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n026.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Thu Jul 7 22:34:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 4.45/2.26 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.45/2.26 # No SInE strategy applied
% 4.45/2.26 # Trying AutoSched0 for 150 seconds
% 4.45/2.26 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.45/2.26 # and selection function SelectComplexExceptUniqMaxHorn.
% 4.45/2.26 #
% 4.45/2.26 # Preprocessing time : 0.013 s
% 4.45/2.26 # Presaturation interreduction done
% 4.45/2.26
% 4.45/2.26 # Proof found!
% 4.45/2.26 # SZS status Theorem
% 4.45/2.26 # SZS output start CNFRefutation
% See solution above
% 4.45/2.26 # Training examples: 0 positive, 0 negative
% 4.45/2.26
% 4.45/2.26 # -------------------------------------------------
% 4.45/2.26 # User time : 0.016 s
% 4.45/2.26 # System time : 0.005 s
% 4.45/2.26 # Total time : 0.021 s
% 4.45/2.26 # Maximum resident set size: 7128 pages
% 4.45/2.26
%------------------------------------------------------------------------------