TSTP Solution File: NUM857+2 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM857+2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n026.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 : 300s
% DateTime : Wed May 31 12:30:52 EDT 2023
% Result : Theorem 0.15s 0.33s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 53 ( 12 unt; 0 def)
% Number of atoms : 122 ( 13 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 122 ( 53 ~; 53 |; 7 &)
% ( 8 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 39 (; 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
geq(vmul(vd526,vd529),vmul(vd527,vd530)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,axiom,
geq(vd529,vd530),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
geq(vd526,vd527),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [Vd517,Vd518,Vd519,Vd520] :
( ( ( greater(Vd519,Vd520)
& geq(Vd517,Vd518) )
| ( geq(Vd519,Vd520)
& greater(Vd517,Vd518) ) )
=> greater(vmul(Vd517,Vd519),vmul(Vd518,Vd520)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f38,axiom,
! [Vd244,Vd245] :
( geq(Vd245,Vd244)
<=> ( greater(Vd245,Vd244)
| Vd245 = Vd244 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f63,plain,
~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f64,plain,
geq(vd529,vd530),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f65,plain,
geq(vd526,vd527),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f66,plain,
! [Vd517,Vd518,Vd519,Vd520] :
( ( ( ~ greater(Vd519,Vd520)
| ~ geq(Vd517,Vd518) )
& ( ~ geq(Vd519,Vd520)
| ~ greater(Vd517,Vd518) ) )
| greater(vmul(Vd517,Vd519),vmul(Vd518,Vd520)) ),
inference(pre_NNF_transformation,[status(esa)],[f5]) ).
fof(f67,plain,
! [X0,X1,X2,X3] :
( ~ greater(X0,X1)
| ~ geq(X2,X3)
| greater(vmul(X2,X0),vmul(X3,X1)) ),
inference(cnf_transformation,[status(esa)],[f66]) ).
fof(f68,plain,
! [X0,X1,X2,X3] :
( ~ geq(X0,X1)
| ~ greater(X2,X3)
| greater(vmul(X2,X0),vmul(X3,X1)) ),
inference(cnf_transformation,[status(esa)],[f66]) ).
fof(f147,plain,
! [Vd244,Vd245] :
( ( ~ geq(Vd245,Vd244)
| greater(Vd245,Vd244)
| Vd245 = Vd244 )
& ( geq(Vd245,Vd244)
| ( ~ greater(Vd245,Vd244)
& Vd245 != Vd244 ) ) ),
inference(NNF_transformation,[status(esa)],[f38]) ).
fof(f148,plain,
( ! [Vd244,Vd245] :
( ~ geq(Vd245,Vd244)
| greater(Vd245,Vd244)
| Vd245 = Vd244 )
& ! [Vd244,Vd245] :
( geq(Vd245,Vd244)
| ( ~ greater(Vd245,Vd244)
& Vd245 != Vd244 ) ) ),
inference(miniscoping,[status(esa)],[f147]) ).
fof(f149,plain,
! [X0,X1] :
( ~ geq(X0,X1)
| greater(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f148]) ).
fof(f150,plain,
! [X0,X1] :
( geq(X0,X1)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f148]) ).
fof(f151,plain,
! [X0,X1] :
( geq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f148]) ).
fof(f197,plain,
! [X0] : geq(X0,X0),
inference(destructive_equality_resolution,[status(esa)],[f151]) ).
fof(f205,plain,
! [X0,X1,X2,X3] :
( ~ greater(X0,X1)
| ~ geq(X2,X3)
| geq(vmul(X2,X0),vmul(X3,X1)) ),
inference(resolution,[status(thm)],[f67,f150]) ).
fof(f206,plain,
! [X0,X1,X2,X3] :
( ~ geq(X0,X1)
| ~ greater(X2,X3)
| geq(vmul(X2,X0),vmul(X3,X1)) ),
inference(resolution,[status(thm)],[f68,f150]) ).
fof(f207,plain,
( spl0_0
<=> greater(vd529,vd530) ),
introduced(split_symbol_definition) ).
fof(f209,plain,
( ~ greater(vd529,vd530)
| spl0_0 ),
inference(component_clause,[status(thm)],[f207]) ).
fof(f210,plain,
( spl0_1
<=> geq(vd526,vd527) ),
introduced(split_symbol_definition) ).
fof(f212,plain,
( ~ geq(vd526,vd527)
| spl0_1 ),
inference(component_clause,[status(thm)],[f210]) ).
fof(f213,plain,
( ~ greater(vd529,vd530)
| ~ geq(vd526,vd527) ),
inference(resolution,[status(thm)],[f205,f63]) ).
fof(f214,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f213,f207,f210]) ).
fof(f215,plain,
( spl0_2
<=> geq(vd529,vd530) ),
introduced(split_symbol_definition) ).
fof(f217,plain,
( ~ geq(vd529,vd530)
| spl0_2 ),
inference(component_clause,[status(thm)],[f215]) ).
fof(f218,plain,
( spl0_3
<=> vd529 = vd530 ),
introduced(split_symbol_definition) ).
fof(f219,plain,
( vd529 = vd530
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f218]) ).
fof(f221,plain,
( ~ geq(vd529,vd530)
| vd529 = vd530
| spl0_0 ),
inference(resolution,[status(thm)],[f209,f149]) ).
fof(f222,plain,
( ~ spl0_2
| spl0_3
| spl0_0 ),
inference(split_clause,[status(thm)],[f221,f215,f218,f207]) ).
fof(f223,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f212,f65]) ).
fof(f224,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f223]) ).
fof(f225,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f217,f64]) ).
fof(f226,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f225]) ).
fof(f228,plain,
( ~ geq(vmul(vd526,vd529),vmul(vd527,vd529))
| ~ spl0_3 ),
inference(backward_demodulation,[status(thm)],[f219,f63]) ).
fof(f230,plain,
( spl0_4
<=> geq(vd529,vd529) ),
introduced(split_symbol_definition) ).
fof(f232,plain,
( ~ geq(vd529,vd529)
| spl0_4 ),
inference(component_clause,[status(thm)],[f230]) ).
fof(f238,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f232,f197]) ).
fof(f239,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f238]) ).
fof(f245,plain,
( spl0_7
<=> greater(vd526,vd527) ),
introduced(split_symbol_definition) ).
fof(f247,plain,
( ~ greater(vd526,vd527)
| spl0_7 ),
inference(component_clause,[status(thm)],[f245]) ).
fof(f248,plain,
( ~ geq(vd529,vd529)
| ~ greater(vd526,vd527)
| ~ spl0_3 ),
inference(resolution,[status(thm)],[f206,f228]) ).
fof(f249,plain,
( ~ spl0_4
| ~ spl0_7
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f248,f230,f245,f218]) ).
fof(f250,plain,
( spl0_8
<=> vd526 = vd527 ),
introduced(split_symbol_definition) ).
fof(f251,plain,
( vd526 = vd527
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f250]) ).
fof(f253,plain,
( ~ geq(vd526,vd527)
| vd526 = vd527
| spl0_7 ),
inference(resolution,[status(thm)],[f247,f149]) ).
fof(f254,plain,
( ~ spl0_1
| spl0_8
| spl0_7 ),
inference(split_clause,[status(thm)],[f253,f210,f250,f245]) ).
fof(f256,plain,
( ~ geq(vmul(vd526,vd529),vmul(vd526,vd529))
| ~ spl0_8
| ~ spl0_3 ),
inference(backward_demodulation,[status(thm)],[f251,f228]) ).
fof(f257,plain,
( $false
| ~ spl0_8
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f256,f197]) ).
fof(f258,plain,
( ~ spl0_8
| ~ spl0_3 ),
inference(contradiction_clause,[status(thm)],[f257]) ).
fof(f259,plain,
$false,
inference(sat_refutation,[status(thm)],[f214,f222,f224,f226,f239,f249,f254,f258]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : NUM857+2 : TPTP v8.1.2. Released v4.1.0.
% 0.02/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n026.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue May 30 10:11:43 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.09/0.31 % Drodi V3.5.1
% 0.15/0.33 % Refutation found
% 0.15/0.33 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.33 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.35 % Elapsed time: 0.047394 seconds
% 0.15/0.35 % CPU time: 0.051902 seconds
% 0.15/0.35 % Memory used: 11.590 MB
%------------------------------------------------------------------------------