TSTP Solution File: NUM851+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM851+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 7.84s 2.28s
% Output : CNFRefutation 7.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 7 RR)
% Number of literals : 11 ( 10 equ; 4 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
vplus(vmul(vd471,vd469),vmul(vd473,vd469)) != vmul(vplus(vd471,vd473),vd469),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-srxrjab1/lgb.p',i_0_1) ).
cnf(i_0_3,plain,
vplus(vd471,vd473) = vd470,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-srxrjab1/lgb.p',i_0_3) ).
cnf(i_0_7,plain,
vmul(X1,X2) = vmul(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-srxrjab1/lgb.p',i_0_7) ).
cnf(i_0_6,plain,
vplus(vmul(X1,X2),vmul(X1,X3)) = vmul(X1,vplus(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-srxrjab1/lgb.p',i_0_6) ).
cnf(c_0_12,negated_conjecture,
vplus(vmul(vd471,vd469),vmul(vd473,vd469)) != vmul(vplus(vd471,vd473),vd469),
i_0_1 ).
cnf(c_0_13,plain,
vplus(vd471,vd473) = vd470,
i_0_3 ).
cnf(c_0_14,negated_conjecture,
vplus(vmul(vd471,vd469),vmul(vd473,vd469)) != vmul(vd470,vd469),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
vmul(X1,X2) = vmul(X2,X1),
i_0_7 ).
cnf(c_0_16,negated_conjecture,
vplus(vmul(vd469,vd471),vmul(vd469,vd473)) != vmul(vd469,vd470),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_17,plain,
vplus(vmul(X1,X2),vmul(X1,X3)) = vmul(X1,vplus(X2,X3)),
i_0_6 ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM851+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n017.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jul 7 20:05:02 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 7.84/2.28 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.84/2.28 # No SInE strategy applied
% 7.84/2.28 # Trying AutoSched0 for 150 seconds
% 7.84/2.28 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.84/2.28 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.84/2.28 #
% 7.84/2.28 # Preprocessing time : 0.012 s
% 7.84/2.28 # Presaturation interreduction done
% 7.84/2.28
% 7.84/2.28 # Proof found!
% 7.84/2.28 # SZS status Theorem
% 7.84/2.28 # SZS output start CNFRefutation
% See solution above
% 7.84/2.28 # Training examples: 0 positive, 0 negative
% 7.84/2.28
% 7.84/2.28 # -------------------------------------------------
% 7.84/2.28 # User time : 0.014 s
% 7.84/2.28 # System time : 0.003 s
% 7.84/2.28 # Total time : 0.017 s
% 7.84/2.28 # Maximum resident set size: 7128 pages
% 7.84/2.28
%------------------------------------------------------------------------------