%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : NUM857+2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:18:14 AM UTC 2026
% Result : Theorem 0.21s 0.43s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 26 unt; 0 def)
% Number of atoms : 72 ( 19 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 46 ( 20 ~; 18 |; 3 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 50 ( 2 sgn 18 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(318, 0), 0)',axiom,
! [Vd517,Vd518,Vd519,Vd520] :
( ( ( greater(Vd517,Vd518)
& geq(Vd519,Vd520) )
| ( geq(Vd517,Vd518)
& greater(Vd519,Vd520) ) )
=> greater(vmul(Vd517,Vd519),vmul(Vd518,Vd520)) ),
file('theBenchmark.p','ass(cond(318, 0), 0)') ).
fof('ass(cond(270, 0), 0)',axiom,
! [Vd418,Vd419] : vmul(Vd418,Vd419) = vmul(Vd419,Vd418),
file('theBenchmark.p','ass(cond(270, 0), 0)') ).
fof('qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))',axiom,
! [Vd396,Vd397] :
( vmul(Vd396,v1) = Vd396
& vmul(Vd396,vsucc(Vd397)) = vplus(vmul(Vd396,Vd397),Vd396) ),
file('theBenchmark.p','qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))') ).
fof('ass(cond(241, 0), 0)',axiom,
! [Vd386,Vd387] :
( less(Vd386,vplus(Vd387,v1))
=> leq(Vd386,Vd387) ),
file('theBenchmark.p','ass(cond(241, 0), 0)') ).
fof('ass(cond(163, 0), 0)',axiom,
! [Vd258,Vd259] :
( leq(Vd258,Vd259)
=> geq(Vd259,Vd258) ),
file('theBenchmark.p','ass(cond(163, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 16), 1)',axiom,
! [Vd244,Vd245] :
( geq(Vd245,Vd244)
<=> ( Vd245 = Vd244
| greater(Vd245,Vd244) ) ),
file('theBenchmark.p','def(cond(conseq(axiom(3)), 16), 1)') ).
fof('def(cond(conseq(axiom(3)), 12), 1)',axiom,
! [Vd198,Vd199] :
( less(Vd199,Vd198)
<=> ? [Vd201] : Vd198 = vplus(Vd199,Vd201) ),
file('theBenchmark.p','def(cond(conseq(axiom(3)), 12), 1)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [Vd78,Vd79] : vplus(Vd79,Vd78) = vplus(Vd78,Vd79),
file('theBenchmark.p','ass(cond(61, 0), 0)') ).
fof('holds(conseq(323), 532, 0)',conjecture,
geq(vmul(vd526,vd529),vmul(vd527,vd530)),
file('theBenchmark.p','holds(conseq(323), 532, 0)') ).
fof('holds(conseq(323), 532, 0)_neg',negated_conjecture,
~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
inference(assume_negation,[status(cth)],['holds(conseq(323), 532, 0)']) ).
fof('holds(conjunct2(antec(323)), 531, 0)',axiom,
geq(vd529,vd530),
file('theBenchmark.p','holds(conjunct2(antec(323)), 531, 0)') ).
cnf(c_60,plain,
geq(vd529,vd530),
inference(clausify,[status(thm)],['holds(conjunct2(antec(323)), 531, 0)']) ).
fof('holds(conjunct1(antec(323)), 528, 0)',axiom,
geq(vd526,vd527),
file('theBenchmark.p','holds(conjunct1(antec(323)), 528, 0)') ).
cnf(c_61,plain,
geq(vd526,vd527),
inference(clausify,[status(thm)],['holds(conjunct1(antec(323)), 528, 0)']) ).
cnf(c_62,plain,
( greater(vmul(C,A),vmul(D,B))
| ~ geq(C,D)
| ~ greater(A,B) ),
inference(clausify,[status(thm)],['ass(cond(318, 0), 0)']) ).
cnf(c_73,plain,
vmul(A,B) = vmul(B,A),
inference(clausify,[status(thm)],['ass(cond(270, 0), 0)']) ).
cnf(c_77,plain,
vmul(A,v1) = A,
inference(clausify,[status(thm)],['qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))']) ).
cnf(c_78,plain,
( leq(A,B)
| ~ less(A,vplus(B,v1)) ),
inference(clausify,[status(thm)],['ass(cond(241, 0), 0)']) ).
cnf(c_96,plain,
( geq(B,A)
| ~ leq(A,B) ),
inference(clausify,[status(thm)],['ass(cond(163, 0), 0)']) ).
cnf(c_101,plain,
( B = A
| greater(A,B)
| ~ geq(A,B) ),
inference(clausify,[status(thm)],['def(cond(conseq(axiom(3)), 16), 1)']) ).
cnf(c_102,plain,
( ~ greater(A,B)
| geq(A,B) ),
inference(clausify,[status(thm)],['def(cond(conseq(axiom(3)), 16), 1)']) ).
cnf(c_103,plain,
( B != A
| geq(A,B) ),
inference(clausify,[status(thm)],['def(cond(conseq(axiom(3)), 16), 1)']) ).
cnf(c_111,plain,
( vplus(A,C) != B
| less(A,B) ),
inference(clausify,[status(thm)],['def(cond(conseq(axiom(3)), 12), 1)']) ).
cnf(c_120,plain,
vplus(A,B) = vplus(B,A),
inference(clausify,[status(thm)],['ass(cond(61, 0), 0)']) ).
cnf(c_134,negated_conjecture,
~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
inference(clausify,[status(thm)],['holds(conseq(323), 532, 0)_neg']) ).
cnf(c_142,plain,
( greater(vmul(vd529,A),vmul(vd530,B))
| ~ greater(A,B) ),
inference(resolve,[status(thm)],[c_62,c_60]) ).
cnf(c_181,plain,
( vd527 = vd526
| greater(vd526,vd527) ),
inference(resolve,[status(thm)],[c_101,c_61]) ).
cnf(c_182,plain,
( vd530 = vd529
| greater(vd529,vd530) ),
inference(resolve,[status(thm)],[c_101,c_60]) ).
cnf(c_1138,plain,
geq(A,vmul(A,v1)),
inference(resolve,[status(thm)],[c_103,c_77]) ).
cnf(c_184,plain,
geq(A,A),
inference(paramod,[status(thm)],[c_77,c_1138]) ).
cnf(c_257,plain,
less(A,vplus(B,A)),
inference(resolve,[status(thm)],[c_120,c_111]) ).
cnf(c_290,negated_conjecture,
~ greater(vmul(vd526,vd529),vmul(vd527,vd530)),
inference(resolve,[status(thm)],[c_102,c_134]) ).
cnf(c_291,negated_conjecture,
~ leq(vmul(vd527,vd530),vmul(vd526,vd529)),
inference(resolve,[status(thm)],[c_96,c_134]) ).
cnf(c_1139,plain,
( greater(vmul(vd529,vd526),vmul(vd530,vd527))
| vd527 = vd526 ),
inference(resolve,[status(thm)],[c_181,c_142]) ).
cnf(c_1140,plain,
( greater(vmul(vd526,vd529),vmul(vd530,vd527))
| vd527 = vd526 ),
inference(paramod,[status(thm)],[c_73,c_1139]) ).
cnf(c_1141,plain,
( greater(vmul(vd526,vd529),vmul(vd527,vd530))
| vd527 = vd526 ),
inference(paramod,[status(thm)],[c_73,c_1140]) ).
cnf(c_425,plain,
vd527 = vd526,
inference(resolve,[status(thm)],[c_290,c_1141]) ).
cnf(c_427,negated_conjecture,
~ leq(vmul(vd526,vd530),vmul(vd526,vd529)),
inference(paramod,[status(thm)],[c_425,c_291]) ).
cnf(c_428,negated_conjecture,
~ greater(vmul(vd526,vd529),vmul(vd526,vd530)),
inference(paramod,[status(thm)],[c_425,c_290]) ).
cnf(c_1142,plain,
~ less(vmul(vd526,vd530),vplus(vmul(vd526,vd529),v1)),
inference(resolve,[status(thm)],[c_78,c_427]) ).
cnf(c_1040,plain,
~ less(vmul(vd526,vd530),vplus(v1,vmul(vd526,vd529))),
inference(paramod,[status(thm)],[c_120,c_1142]) ).
cnf(c_1143,plain,
( greater(vmul(C,A),vmul(C,B))
| ~ greater(A,B) ),
inference(resolve,[status(thm)],[c_62,c_184]) ).
cnf(c_1120,plain,
~ greater(vd529,vd530),
inference(resolve,[status(thm)],[c_1143,c_428]) ).
cnf(c_1121,plain,
vd530 = vd529,
inference(resolve,[status(thm)],[c_1120,c_182]) ).
cnf(c_1144,plain,
~ less(vmul(vd526,vd529),vplus(v1,vmul(vd526,vd529))),
inference(paramod,[status(thm)],[c_1121,c_1040]) ).
cnf(c_1137,plain,
$false,
inference(resolve,[status(thm)],[c_257,c_1144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM857+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.02 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Sat Sep 26 04:13:19 UTC 2026
% 0.03/0.29 % CPUTime :
% 0.03/0.29 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.03/0.29 % Process 3886551 was started by sandbox2 on n012,
% 0.03/0.29 % Sat Sep 26 04:13:19 2026
% 0.03/0.29 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.03/0.30
% 0.03/0.30 % From the command line: assign(max_seconds, 300).
% 0.21/0.43
% 0.21/0.43 % SZS status Theorem for theBenchmark
% 0.21/0.43
% 0.21/0.43 % Proof 1 at 0.07 (+ 0.03) seconds.
% 0.21/0.43 % Length of proof is 36.
% 0.21/0.43 % Level of proof is 7.
% 0.21/0.43 % Maximum clause weight is 24.000.
% 0.21/0.43 % Given clauses 195.
% 0.21/0.43
% 0.21/0.43 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------