TSTP Solution File: NUM852+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM852+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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.92s 2.36s
% Output : CNFRefutation 7.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 12 unt; 0 nHn; 13 RR)
% Number of literals : 26 ( 9 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 31 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_21,plain,
( greater(X1,X2)
| X1 != vplus(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d4v7biki/lgb.p',i_0_21) ).
cnf(i_0_10,plain,
vplus(vmul(X1,X2),vmul(X1,X3)) = vmul(X1,vplus(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d4v7biki/lgb.p',i_0_10) ).
cnf(i_0_7,plain,
( vmul(vplus(X1,vskolem9(X2,X1)),vd469) = vmul(X2,vd469)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d4v7biki/lgb.p',i_0_7) ).
cnf(i_0_11,plain,
vmul(X1,X2) = vmul(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d4v7biki/lgb.p',i_0_11) ).
cnf(i_0_1,negated_conjecture,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d4v7biki/lgb.p',i_0_1) ).
cnf(i_0_2,plain,
greater(vd481,vd480),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d4v7biki/lgb.p',i_0_2) ).
cnf(c_0_28,plain,
( greater(X1,X2)
| X1 != vplus(X2,X3) ),
i_0_21 ).
cnf(c_0_29,plain,
greater(vplus(X1,X2),X1),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_30,plain,
vplus(vmul(X1,X2),vmul(X1,X3)) = vmul(X1,vplus(X2,X3)),
i_0_10 ).
cnf(c_0_31,plain,
( vmul(vplus(X1,vskolem9(X2,X1)),vd469) = vmul(X2,vd469)
| ~ greater(X2,X1) ),
i_0_7 ).
cnf(c_0_32,plain,
vmul(X1,X2) = vmul(X2,X1),
i_0_11 ).
cnf(c_0_33,plain,
greater(vmul(X1,vplus(X2,X3)),vmul(X1,X2)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( vmul(vd469,vplus(X1,vskolem9(X2,X1))) = vmul(X2,vd469)
| ~ greater(X2,X1) ),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
i_0_1 ).
cnf(c_0_36,plain,
( greater(vmul(X1,vd469),vmul(vd469,X2))
| ~ greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
~ greater(vmul(vd469,vd481),vmul(vd469,vd480)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_32]),c_0_32]) ).
cnf(c_0_38,plain,
( greater(vmul(vd469,X1),vmul(vd469,X2))
| ~ greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_32]) ).
cnf(c_0_39,plain,
greater(vd481,vd480),
i_0_2 ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : NUM852+2 : TPTP v8.1.0. Released v4.1.0.
% 0.05/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n005.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 : Tue Jul 5 21:25:09 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 7.92/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.92/2.36 # No SInE strategy applied
% 7.92/2.36 # Trying AutoSched0 for 150 seconds
% 7.92/2.36 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.92/2.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.92/2.36 #
% 7.92/2.36 # Preprocessing time : 0.023 s
% 7.92/2.36 # Presaturation interreduction done
% 7.92/2.36
% 7.92/2.36 # Proof found!
% 7.92/2.36 # SZS status Theorem
% 7.92/2.36 # SZS output start CNFRefutation
% See solution above
% 7.92/2.36 # Training examples: 0 positive, 0 negative
% 7.92/2.36
% 7.92/2.36 # -------------------------------------------------
% 7.92/2.36 # User time : 0.030 s
% 7.92/2.36 # System time : 0.005 s
% 7.92/2.36 # Total time : 0.036 s
% 7.92/2.36 # Maximum resident set size: 7128 pages
% 7.92/2.36
%------------------------------------------------------------------------------