TSTP Solution File: NUM847+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM847+1 : 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:33 EDT 2022
% Result : Theorem 7.08s 2.23s
% Output : CNFRefutation 7.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 3 RR)
% Number of literals : 12 ( 11 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_9,plain,
vmul(X1,X2) = vmul(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jxvh1n_9/input.p',i_0_9) ).
cnf(i_0_56,plain,
vplus(X1,X2) = vplus(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jxvh1n_9/input.p',i_0_56) ).
cnf(i_0_59,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jxvh1n_9/input.p',i_0_59) ).
cnf(i_0_1,negated_conjecture,
vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436) != vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jxvh1n_9/input.p',i_0_1) ).
cnf(c_0_64,plain,
vmul(X1,X2) = vmul(X2,X1),
i_0_9 ).
cnf(c_0_65,plain,
vplus(X1,X2) = vplus(X2,X1),
i_0_56 ).
cnf(c_0_66,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
i_0_59 ).
cnf(c_0_67,negated_conjecture,
vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436) != vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)),
i_0_1 ).
cnf(c_0_68,plain,
vmul(X1,X2) = vmul(X2,X1),
c_0_64 ).
cnf(c_0_69,plain,
vplus(X1,X2) = vplus(X2,X1),
c_0_65 ).
cnf(c_0_70,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
c_0_66 ).
cnf(c_0_71,negated_conjecture,
$false,
inference(ar,[status(thm)],[c_0_67,c_0_68,c_0_69,c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM847+1 : 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 : Tue Jul 5 06:01:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.08/2.23 # ENIGMATIC: Solved by autoschedule:
% 7.08/2.23 # No SInE strategy applied
% 7.08/2.23 # Trying AutoSched0 for 150 seconds
% 7.08/2.23 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.08/2.23 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.08/2.23 #
% 7.08/2.23 # Preprocessing time : 0.026 s
% 7.08/2.23
% 7.08/2.23 # Proof found!
% 7.08/2.23 # SZS status Theorem
% 7.08/2.23 # SZS output start CNFRefutation
% See solution above
% 7.08/2.23 # Training examples: 0 positive, 0 negative
% 7.08/2.23
% 7.08/2.23 # -------------------------------------------------
% 7.08/2.23 # User time : 0.028 s
% 7.08/2.23 # System time : 0.004 s
% 7.08/2.23 # Total time : 0.032 s
% 7.08/2.23 # Maximum resident set size: 7120 pages
% 7.08/2.23
%------------------------------------------------------------------------------