TSTP Solution File: NUM839+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM839+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n009.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:46 EDT 2023
% Result : Theorem 0.12s 0.36s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 44 ( 11 unt; 0 def)
% Number of atoms : 81 ( 9 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 70 ( 33 ~; 31 |; 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 : 39 (; 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
greater(vd328,vd329),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ greater(vd328,vd329),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,axiom,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [Vd301,Vd302,Vd303] :
( greater(Vd301,Vd302)
=> greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,axiom,
! [Vd226,Vd227] :
( less(Vd226,Vd227)
=> greater(Vd227,Vd226) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,axiom,
! [Vd208,Vd209] :
( greater(Vd208,Vd209)
=> less(Vd209,Vd208) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,axiom,
! [Vd203,Vd204] :
( Vd203 = Vd204
| greater(Vd203,Vd204)
| less(Vd203,Vd204) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,axiom,
! [Vd203,Vd204] :
( Vd203 != Vd204
| ~ less(Vd203,Vd204) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,axiom,
! [Vd203,Vd204] :
( ~ greater(Vd203,Vd204)
| ~ less(Vd203,Vd204) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f39,plain,
~ greater(vd328,vd329),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f40,plain,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f47,plain,
! [Vd301,Vd302,Vd303] :
( ~ greater(Vd301,Vd302)
| greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303)) ),
inference(pre_NNF_transformation,[status(esa)],[f6]) ).
fof(f48,plain,
! [Vd301,Vd302] :
( ~ greater(Vd301,Vd302)
| ! [Vd303] : greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303)) ),
inference(miniscoping,[status(esa)],[f47]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ~ greater(X0,X1)
| greater(vplus(X0,X2),vplus(X1,X2)) ),
inference(cnf_transformation,[status(esa)],[f48]) ).
fof(f75,plain,
! [Vd226,Vd227] :
( ~ less(Vd226,Vd227)
| greater(Vd227,Vd226) ),
inference(pre_NNF_transformation,[status(esa)],[f15]) ).
fof(f76,plain,
! [X0,X1] :
( ~ less(X0,X1)
| greater(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f75]) ).
fof(f77,plain,
! [Vd208,Vd209] :
( ~ greater(Vd208,Vd209)
| less(Vd209,Vd208) ),
inference(pre_NNF_transformation,[status(esa)],[f16]) ).
fof(f78,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| less(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f77]) ).
fof(f79,plain,
! [X0,X1] :
( X0 = X1
| greater(X0,X1)
| less(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f80,plain,
! [X0,X1] :
( X0 != X1
| ~ less(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f81,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f19]) ).
fof(f121,plain,
! [X0] : ~ less(X0,X0),
inference(destructive_equality_resolution,[status(esa)],[f80]) ).
fof(f128,plain,
less(vplus(vd329,vd330),vplus(vd328,vd330)),
inference(resolution,[status(thm)],[f78,f40]) ).
fof(f132,plain,
! [X0,X1] :
( X0 = X1
| greater(X0,X1)
| greater(X1,X0) ),
inference(resolution,[status(thm)],[f79,f76]) ).
fof(f133,plain,
( spl0_0
<=> vd329 = vd328 ),
introduced(split_symbol_definition) ).
fof(f134,plain,
( vd329 = vd328
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f133]) ).
fof(f136,plain,
( spl0_1
<=> greater(vd329,vd328) ),
introduced(split_symbol_definition) ).
fof(f137,plain,
( greater(vd329,vd328)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f136]) ).
fof(f139,plain,
( vd329 = vd328
| greater(vd329,vd328) ),
inference(resolution,[status(thm)],[f132,f39]) ).
fof(f140,plain,
( spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f139,f133,f136]) ).
fof(f146,plain,
~ greater(vplus(vd329,vd330),vplus(vd328,vd330)),
inference(resolution,[status(thm)],[f128,f81]) ).
fof(f150,plain,
~ greater(vd329,vd328),
inference(resolution,[status(thm)],[f146,f49]) ).
fof(f163,plain,
( spl0_4
<=> greater(vd328,vd329) ),
introduced(split_symbol_definition) ).
fof(f164,plain,
( greater(vd328,vd329)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f163]) ).
fof(f166,plain,
( vd328 = vd329
| greater(vd328,vd329) ),
inference(resolution,[status(thm)],[f150,f132]) ).
fof(f167,plain,
( spl0_0
| spl0_4 ),
inference(split_clause,[status(thm)],[f166,f133,f163]) ).
fof(f185,plain,
( less(vplus(vd328,vd330),vplus(vd328,vd330))
| ~ spl0_0 ),
inference(backward_demodulation,[status(thm)],[f134,f128]) ).
fof(f186,plain,
( $false
| ~ spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f185,f121]) ).
fof(f187,plain,
~ spl0_0,
inference(contradiction_clause,[status(thm)],[f186]) ).
fof(f188,plain,
( less(vd328,vd329)
| ~ spl0_1 ),
inference(resolution,[status(thm)],[f137,f78]) ).
fof(f190,plain,
( ~ greater(vd328,vd329)
| ~ spl0_1 ),
inference(resolution,[status(thm)],[f188,f81]) ).
fof(f197,plain,
( $false
| ~ spl0_1
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f164,f190]) ).
fof(f198,plain,
( ~ spl0_1
| ~ spl0_4 ),
inference(contradiction_clause,[status(thm)],[f197]) ).
fof(f199,plain,
$false,
inference(sat_refutation,[status(thm)],[f140,f167,f187,f198]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM839+1 : TPTP v8.1.2. Released v4.1.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue May 30 09:50:31 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Drodi V3.5.1
% 0.12/0.36 % Refutation found
% 0.12/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.37 % Elapsed time: 0.024090 seconds
% 0.19/0.37 % CPU time: 0.035663 seconds
% 0.19/0.37 % Memory used: 14.597 MB
%------------------------------------------------------------------------------