TSTP Solution File: NUM840+2 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM840+2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n021.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 0.11s 0.35s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 11 unt; 0 def)
% Number of atoms : 85 ( 9 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 76 ( 37 ~; 33 |; 0 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 47 (; 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
less(vd328,vd329),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ less(vd328,vd329),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,axiom,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [Vd301,Vd302,Vd303] :
( less(Vd301,Vd302)
=> less(vplus(Vd301,Vd303),vplus(Vd302,Vd303)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [Vd226,Vd227] :
( less(Vd226,Vd227)
=> greater(Vd227,Vd226) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [Vd208,Vd209] :
( greater(Vd208,Vd209)
=> less(Vd209,Vd208) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [Vd203,Vd204] :
( Vd203 = Vd204
| greater(Vd203,Vd204)
| less(Vd203,Vd204) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f13,axiom,
! [Vd203,Vd204] :
( ~ greater(Vd203,Vd204)
| ~ less(Vd203,Vd204) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,axiom,
! [Vd203,Vd204] :
( Vd203 != Vd204
| ~ greater(Vd203,Vd204) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f28,plain,
~ less(vd328,vd329),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f29,plain,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f34,plain,
! [Vd301,Vd302,Vd303] :
( ~ less(Vd301,Vd302)
| less(vplus(Vd301,Vd303),vplus(Vd302,Vd303)) ),
inference(pre_NNF_transformation,[status(esa)],[f6]) ).
fof(f35,plain,
! [Vd301,Vd302] :
( ~ less(Vd301,Vd302)
| ! [Vd303] : less(vplus(Vd301,Vd303),vplus(Vd302,Vd303)) ),
inference(miniscoping,[status(esa)],[f34]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ~ less(X0,X1)
| less(vplus(X0,X2),vplus(X1,X2)) ),
inference(cnf_transformation,[status(esa)],[f35]) ).
fof(f43,plain,
! [Vd226,Vd227] :
( ~ less(Vd226,Vd227)
| greater(Vd227,Vd226) ),
inference(pre_NNF_transformation,[status(esa)],[f9]) ).
fof(f44,plain,
! [X0,X1] :
( ~ less(X0,X1)
| greater(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f43]) ).
fof(f45,plain,
! [Vd208,Vd209] :
( ~ greater(Vd208,Vd209)
| less(Vd209,Vd208) ),
inference(pre_NNF_transformation,[status(esa)],[f10]) ).
fof(f46,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| less(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f45]) ).
fof(f47,plain,
! [X0,X1] :
( X0 = X1
| greater(X0,X1)
| less(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f49,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f13]) ).
fof(f50,plain,
! [X0,X1] :
( X0 != X1
| ~ greater(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f82,plain,
( spl0_1
<=> vd328 = vd329 ),
introduced(split_symbol_definition) ).
fof(f83,plain,
( vd328 = vd329
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f82]) ).
fof(f94,plain,
! [X0] : ~ greater(X0,X0),
inference(destructive_equality_resolution,[status(esa)],[f50]) ).
fof(f101,plain,
greater(vplus(vd329,vd330),vplus(vd328,vd330)),
inference(resolution,[status(thm)],[f29,f44]) ).
fof(f104,plain,
! [X0,X1] :
( X0 = X1
| less(X0,X1)
| less(X1,X0) ),
inference(resolution,[status(thm)],[f47,f46]) ).
fof(f106,plain,
( spl0_4
<=> less(vd329,vd328) ),
introduced(split_symbol_definition) ).
fof(f107,plain,
( less(vd329,vd328)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f106]) ).
fof(f109,plain,
( vd329 = vd328
| less(vd329,vd328) ),
inference(resolution,[status(thm)],[f104,f28]) ).
fof(f110,plain,
( spl0_1
| spl0_4 ),
inference(split_clause,[status(thm)],[f109,f82,f106]) ).
fof(f113,plain,
! [X0,X1,X2] :
( ~ less(X0,X1)
| greater(vplus(X1,X2),vplus(X0,X2)) ),
inference(resolution,[status(thm)],[f36,f44]) ).
fof(f115,plain,
~ less(vplus(vd329,vd330),vplus(vd328,vd330)),
inference(resolution,[status(thm)],[f101,f49]) ).
fof(f117,plain,
! [X0,X1,X2] :
( ~ less(X0,X1)
| ~ less(vplus(X1,X2),vplus(X0,X2)) ),
inference(resolution,[status(thm)],[f113,f49]) ).
fof(f119,plain,
~ less(vd329,vd328),
inference(resolution,[status(thm)],[f115,f36]) ).
fof(f125,plain,
( spl0_6
<=> less(vd328,vd329) ),
introduced(split_symbol_definition) ).
fof(f126,plain,
( less(vd328,vd329)
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f125]) ).
fof(f128,plain,
( vd328 = vd329
| less(vd328,vd329) ),
inference(resolution,[status(thm)],[f119,f104]) ).
fof(f129,plain,
( spl0_1
| spl0_6 ),
inference(split_clause,[status(thm)],[f128,f82,f125]) ).
fof(f131,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ less(X1,X0) ),
inference(resolution,[status(thm)],[f117,f36]) ).
fof(f189,plain,
( greater(vplus(vd328,vd330),vplus(vd328,vd330))
| ~ spl0_1 ),
inference(backward_demodulation,[status(thm)],[f83,f101]) ).
fof(f190,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f189,f94]) ).
fof(f191,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f190]) ).
fof(f192,plain,
( ~ less(vd328,vd329)
| ~ spl0_4 ),
inference(resolution,[status(thm)],[f107,f131]) ).
fof(f201,plain,
( $false
| ~ spl0_4
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f126,f192]) ).
fof(f202,plain,
( ~ spl0_4
| ~ spl0_6 ),
inference(contradiction_clause,[status(thm)],[f201]) ).
fof(f203,plain,
$false,
inference(sat_refutation,[status(thm)],[f110,f129,f191,f202]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : NUM840+2 : TPTP v8.1.2. Released v4.1.0.
% 0.02/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue May 30 09:48:22 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.11/0.34 % Drodi V3.5.1
% 0.11/0.35 % Refutation found
% 0.11/0.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.18/0.57 % Elapsed time: 0.015722 seconds
% 0.18/0.57 % CPU time: 0.015484 seconds
% 0.18/0.57 % Memory used: 3.686 MB
%------------------------------------------------------------------------------