TSTP Solution File: NUM848+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM848+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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.65s 2.27s
% Output : CNFRefutation 4.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 4 RR)
% Number of literals : 9 ( 8 equ; 3 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) != vplus(vmul(vd436,vd437),vmul(vd436,vplus(vd439,v1))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-db6i2qlx/lgb.p',i_0_1) ).
cnf(i_0_12,plain,
vplus(X1,X2) = vplus(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-db6i2qlx/lgb.p',i_0_12) ).
cnf(i_0_10,plain,
vplus(vmul(X1,X2),X1) = vmul(X1,vplus(X2,v1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-db6i2qlx/lgb.p',i_0_10) ).
cnf(c_0_16,negated_conjecture,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) != vplus(vmul(vd436,vd437),vmul(vd436,vplus(vd439,v1))),
i_0_1 ).
cnf(c_0_17,plain,
vplus(X1,X2) = vplus(X2,X1),
i_0_12 ).
cnf(c_0_18,plain,
vplus(vmul(X1,X2),X1) = vmul(X1,vplus(X2,v1)),
i_0_10 ).
cnf(c_0_19,negated_conjecture,
vplus(vmul(vd436,vd437),vmul(vd436,vplus(vd439,v1))) != vplus(vmul(vd436,vd437),vplus(vd436,vmul(vd436,vd439))),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
vplus(X1,vmul(X1,X2)) = vmul(X1,vplus(X2,v1)),
inference(rw,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM848+2 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n012.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 : Wed Jul 6 14:49:32 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.41 # ENIGMATIC: Selected complete mode:
% 4.65/2.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.65/2.27 # No SInE strategy applied
% 4.65/2.27 # Trying AutoSched0 for 150 seconds
% 4.65/2.27 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.65/2.27 # and selection function SelectComplexExceptUniqMaxHorn.
% 4.65/2.27 #
% 4.65/2.27 # Preprocessing time : 0.023 s
% 4.65/2.27 # Presaturation interreduction done
% 4.65/2.27
% 4.65/2.27 # Proof found!
% 4.65/2.27 # SZS status Theorem
% 4.65/2.27 # SZS output start CNFRefutation
% See solution above
% 4.65/2.27 # Training examples: 0 positive, 0 negative
% 4.65/2.27
% 4.65/2.27 # -------------------------------------------------
% 4.65/2.27 # User time : 0.024 s
% 4.65/2.27 # System time : 0.005 s
% 4.65/2.27 # Total time : 0.030 s
% 4.65/2.27 # Maximum resident set size: 7128 pages
% 4.65/2.27
%------------------------------------------------------------------------------