TSTP Solution File: NUM841+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM841+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 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 : 300s
% DateTime : Wed May 31 12:30:47 EDT 2023
% Result : Theorem 6.49s 1.46s
% Output : CNFRefutation 6.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 56 ( 16 unt; 0 def)
% Number of atoms : 122 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 118 ( 52 ~; 51 |; 8 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 65 (; 65 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
greater(vplus(vd344,vd347),vplus(vd345,vd348)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,axiom,
vplus(vd348,vd345) = vplus(vd345,vd348),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
vplus(vd345,vd347) = vplus(vd347,vd345),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,axiom,
! [Vd281,Vd282,Vd283] :
( ( ( less(Vd282,Vd283)
& leq(Vd281,Vd282) )
| ( leq(Vd282,Vd283)
& less(Vd281,Vd282) ) )
=> less(Vd281,Vd283) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,axiom,
! [Vd254,Vd255] :
( geq(Vd254,Vd255)
=> leq(Vd255,Vd254) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f22,axiom,
! [Vd244,Vd245] :
( geq(Vd245,Vd244)
<=> ( greater(Vd245,Vd244)
| Vd245 = Vd244 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f23,axiom,
! [Vd226,Vd227] :
( less(Vd226,Vd227)
=> greater(Vd227,Vd226) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f24,axiom,
! [Vd208,Vd209] :
( greater(Vd208,Vd209)
=> less(Vd209,Vd208) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f25,axiom,
! [Vd203,Vd204] :
( Vd203 = Vd204
| greater(Vd203,Vd204)
| less(Vd203,Vd204) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f27,axiom,
! [Vd203,Vd204] :
( ~ greater(Vd203,Vd204)
| ~ less(Vd203,Vd204) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f47,plain,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f48,plain,
vplus(vd348,vd345) = vplus(vd345,vd348),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f49,plain,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f50,plain,
vplus(vd345,vd347) = vplus(vd347,vd345),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f51,plain,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f76,plain,
! [Vd281,Vd282,Vd283] :
( ( ( ~ less(Vd282,Vd283)
| ~ leq(Vd281,Vd282) )
& ( ~ leq(Vd282,Vd283)
| ~ less(Vd281,Vd282) ) )
| less(Vd281,Vd283) ),
inference(pre_NNF_transformation,[status(esa)],[f17]) ).
fof(f77,plain,
! [Vd281,Vd283] :
( ( ! [Vd282] :
( ~ less(Vd282,Vd283)
| ~ leq(Vd281,Vd282) )
& ! [Vd282] :
( ~ leq(Vd282,Vd283)
| ~ less(Vd281,Vd282) ) )
| less(Vd281,Vd283) ),
inference(miniscoping,[status(esa)],[f76]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ~ less(X0,X1)
| ~ leq(X2,X0)
| less(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f77]) ).
fof(f85,plain,
! [Vd254,Vd255] :
( ~ geq(Vd254,Vd255)
| leq(Vd255,Vd254) ),
inference(pre_NNF_transformation,[status(esa)],[f20]) ).
fof(f86,plain,
! [X0,X1] :
( ~ geq(X0,X1)
| leq(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f85]) ).
fof(f92,plain,
! [Vd244,Vd245] :
( ( ~ geq(Vd245,Vd244)
| greater(Vd245,Vd244)
| Vd245 = Vd244 )
& ( geq(Vd245,Vd244)
| ( ~ greater(Vd245,Vd244)
& Vd245 != Vd244 ) ) ),
inference(NNF_transformation,[status(esa)],[f22]) ).
fof(f93,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)],[f92]) ).
fof(f95,plain,
! [X0,X1] :
( geq(X0,X1)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f93]) ).
fof(f97,plain,
! [Vd226,Vd227] :
( ~ less(Vd226,Vd227)
| greater(Vd227,Vd226) ),
inference(pre_NNF_transformation,[status(esa)],[f23]) ).
fof(f98,plain,
! [X0,X1] :
( ~ less(X0,X1)
| greater(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f97]) ).
fof(f99,plain,
! [Vd208,Vd209] :
( ~ greater(Vd208,Vd209)
| less(Vd209,Vd208) ),
inference(pre_NNF_transformation,[status(esa)],[f24]) ).
fof(f100,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| less(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f99]) ).
fof(f101,plain,
! [X0,X1] :
( X0 = X1
| greater(X0,X1)
| less(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f25]) ).
fof(f103,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f27]) ).
fof(f148,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(X1,X0) ),
inference(resolution,[status(thm)],[f103,f100]) ).
fof(f153,plain,
! [X0,X1] :
( X0 = X1
| greater(X0,X1)
| greater(X1,X0) ),
inference(resolution,[status(thm)],[f101,f98]) ).
fof(f170,plain,
( spl0_4
<=> vplus(vd345,vd348) = vplus(vd344,vd347) ),
introduced(split_symbol_definition) ).
fof(f171,plain,
( vplus(vd345,vd348) = vplus(vd344,vd347)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f170]) ).
fof(f173,plain,
( spl0_5
<=> greater(vplus(vd345,vd348),vplus(vd344,vd347)) ),
introduced(split_symbol_definition) ).
fof(f174,plain,
( greater(vplus(vd345,vd348),vplus(vd344,vd347))
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f173]) ).
fof(f176,plain,
( vplus(vd345,vd348) = vplus(vd344,vd347)
| greater(vplus(vd345,vd348),vplus(vd344,vd347)) ),
inference(resolution,[status(thm)],[f153,f47]) ).
fof(f177,plain,
( spl0_4
| spl0_5 ),
inference(split_clause,[status(thm)],[f176,f170,f173]) ).
fof(f179,plain,
greater(vplus(vd347,vd345),vplus(vd345,vd348)),
inference(forward_demodulation,[status(thm)],[f48,f49]) ).
fof(f183,plain,
greater(vplus(vd344,vd347),vplus(vd347,vd345)),
inference(forward_demodulation,[status(thm)],[f50,f51]) ).
fof(f187,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| leq(X1,X0) ),
inference(resolution,[status(thm)],[f95,f86]) ).
fof(f202,plain,
! [X0,X1,X2] :
( ~ less(X0,X1)
| ~ leq(X2,X0)
| greater(X1,X2) ),
inference(resolution,[status(thm)],[f78,f98]) ).
fof(f227,plain,
( greater(vplus(vd347,vd345),vplus(vd344,vd347))
| ~ spl0_4 ),
inference(backward_demodulation,[status(thm)],[f171,f179]) ).
fof(f238,plain,
( ~ greater(vplus(vd344,vd347),vplus(vd347,vd345))
| ~ spl0_4 ),
inference(resolution,[status(thm)],[f227,f148]) ).
fof(f239,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f238,f183]) ).
fof(f240,plain,
~ spl0_4,
inference(contradiction_clause,[status(thm)],[f239]) ).
fof(f277,plain,
! [X0,X1,X2] :
( ~ less(X0,X1)
| greater(X1,X2)
| ~ greater(X0,X2) ),
inference(resolution,[status(thm)],[f202,f187]) ).
fof(f288,plain,
! [X0,X1,X2] :
( greater(X0,X1)
| ~ greater(X2,X1)
| ~ greater(X0,X2) ),
inference(resolution,[status(thm)],[f277,f100]) ).
fof(f308,plain,
! [X0] :
( greater(X0,vplus(vd344,vd347))
| ~ greater(X0,vplus(vd345,vd348))
| ~ spl0_5 ),
inference(resolution,[status(thm)],[f288,f174]) ).
fof(f1446,plain,
( greater(vplus(vd347,vd345),vplus(vd344,vd347))
| ~ spl0_5 ),
inference(resolution,[status(thm)],[f308,f179]) ).
fof(f2294,plain,
( ~ greater(vplus(vd344,vd347),vplus(vd347,vd345))
| ~ spl0_5 ),
inference(resolution,[status(thm)],[f1446,f148]) ).
fof(f2295,plain,
( $false
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f2294,f183]) ).
fof(f2296,plain,
~ spl0_5,
inference(contradiction_clause,[status(thm)],[f2295]) ).
fof(f2297,plain,
$false,
inference(sat_refutation,[status(thm)],[f177,f240,f2296]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM841+1 : TPTP v8.1.2. Released v4.1.0.
% 0.06/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 10:03:08 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 6.49/1.46 % Refutation found
% 6.49/1.46 % SZS status Theorem for theBenchmark: Theorem is valid
% 6.49/1.46 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 6.70/1.49 % Elapsed time: 1.148319 seconds
% 6.70/1.49 % CPU time: 6.769793 seconds
% 6.70/1.49 % Memory used: 107.741 MB
%------------------------------------------------------------------------------