TSTP Solution File: SET795+4 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SET795+4 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n022.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 : Tue Apr 30 20:40:22 EDT 2024
% Result : Theorem 11.32s 1.80s
% Output : CNFRefutation 11.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 84 ( 9 unt; 0 def)
% Number of atoms : 386 ( 31 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 470 ( 168 ~; 176 |; 99 &)
% ( 18 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 8 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-4 aty)
% Number of variables : 234 ( 214 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X,A,B] :
( member(X,unordered_pair(A,B))
<=> ( X = A
| X = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,axiom,
! [R,E] :
( order(R,E)
<=> ( ! [X] :
( member(X,E)
=> apply(R,X,X) )
& ! [X,Y] :
( ( member(X,E)
& member(Y,E) )
=> ( ( apply(R,X,Y)
& apply(R,Y,X) )
=> X = Y ) )
& ! [X,Y,Z] :
( ( member(X,E)
& member(Y,E)
& member(Z,E) )
=> ( ( apply(R,X,Y)
& apply(R,Y,Z) )
=> apply(R,X,Z) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,axiom,
! [R,E,M] :
( upper_bound(M,R,E)
<=> ! [X] :
( member(X,E)
=> apply(R,X,M) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,axiom,
! [A,X,R,E] :
( least_upper_bound(A,X,R,E)
<=> ( member(A,X)
& upper_bound(A,R,X)
& ! [M] :
( ( member(M,E)
& upper_bound(M,R,X) )
=> apply(R,A,M) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f22,conjecture,
! [R,E,A,B] :
( ( order(R,E)
& member(A,E)
& member(B,E)
& apply(R,A,B) )
=> least_upper_bound(B,unordered_pair(A,B),R,E) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f23,negated_conjecture,
~ ! [R,E,A,B] :
( ( order(R,E)
& member(A,E)
& member(B,E)
& apply(R,A,B) )
=> least_upper_bound(B,unordered_pair(A,B),R,E) ),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f60,plain,
! [X,A,B] :
( ( ~ member(X,unordered_pair(A,B))
| X = A
| X = B )
& ( member(X,unordered_pair(A,B))
| ( X != A
& X != B ) ) ),
inference(NNF_transformation,[status(esa)],[f9]) ).
fof(f61,plain,
( ! [X,A,B] :
( ~ member(X,unordered_pair(A,B))
| X = A
| X = B )
& ! [X,A,B] :
( member(X,unordered_pair(A,B))
| ( X != A
& X != B ) ) ),
inference(miniscoping,[status(esa)],[f60]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf_transformation,[status(esa)],[f61]) ).
fof(f64,plain,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
| X0 != X2 ),
inference(cnf_transformation,[status(esa)],[f61]) ).
fof(f78,plain,
! [R,E] :
( order(R,E)
<=> ( ! [X] :
( ~ member(X,E)
| apply(R,X,X) )
& ! [X,Y] :
( ~ member(X,E)
| ~ member(Y,E)
| ~ apply(R,X,Y)
| ~ apply(R,Y,X)
| X = Y )
& ! [X,Y,Z] :
( ~ member(X,E)
| ~ member(Y,E)
| ~ member(Z,E)
| ~ apply(R,X,Y)
| ~ apply(R,Y,Z)
| apply(R,X,Z) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f12]) ).
fof(f79,plain,
! [R,E] :
( pd0_0(E,R)
<=> ( ! [X] :
( ~ member(X,E)
| apply(R,X,X) )
& ! [X,Y] :
( ~ member(X,E)
| ~ member(Y,E)
| ~ apply(R,X,Y)
| ~ apply(R,Y,X)
| X = Y ) ) ),
introduced(predicate_definition,[f78]) ).
fof(f80,plain,
! [R,E] :
( order(R,E)
<=> ( pd0_0(E,R)
& ! [X,Y,Z] :
( ~ member(X,E)
| ~ member(Y,E)
| ~ member(Z,E)
| ~ apply(R,X,Y)
| ~ apply(R,Y,Z)
| apply(R,X,Z) ) ) ),
inference(formula_renaming,[status(thm)],[f78,f79]) ).
fof(f81,plain,
! [R,E] :
( ( ~ order(R,E)
| ( pd0_0(E,R)
& ! [X,Y,Z] :
( ~ member(X,E)
| ~ member(Y,E)
| ~ member(Z,E)
| ~ apply(R,X,Y)
| ~ apply(R,Y,Z)
| apply(R,X,Z) ) ) )
& ( order(R,E)
| ~ pd0_0(E,R)
| ? [X,Y,Z] :
( member(X,E)
& member(Y,E)
& member(Z,E)
& apply(R,X,Y)
& apply(R,Y,Z)
& ~ apply(R,X,Z) ) ) ),
inference(NNF_transformation,[status(esa)],[f80]) ).
fof(f82,plain,
( ! [R,E] :
( ~ order(R,E)
| ( pd0_0(E,R)
& ! [X,Y,Z] :
( ~ member(X,E)
| ~ member(Y,E)
| ~ member(Z,E)
| ~ apply(R,X,Y)
| ~ apply(R,Y,Z)
| apply(R,X,Z) ) ) )
& ! [R,E] :
( order(R,E)
| ~ pd0_0(E,R)
| ? [X,Y,Z] :
( member(X,E)
& member(Y,E)
& member(Z,E)
& apply(R,X,Y)
& apply(R,Y,Z)
& ~ apply(R,X,Z) ) ) ),
inference(miniscoping,[status(esa)],[f81]) ).
fof(f83,plain,
( ! [R,E] :
( ~ order(R,E)
| ( pd0_0(E,R)
& ! [X,Y,Z] :
( ~ member(X,E)
| ~ member(Y,E)
| ~ member(Z,E)
| ~ apply(R,X,Y)
| ~ apply(R,Y,Z)
| apply(R,X,Z) ) ) )
& ! [R,E] :
( order(R,E)
| ~ pd0_0(E,R)
| ( member(sk0_3(E,R),E)
& member(sk0_4(E,R),E)
& member(sk0_5(E,R),E)
& apply(R,sk0_3(E,R),sk0_4(E,R))
& apply(R,sk0_4(E,R),sk0_5(E,R))
& ~ apply(R,sk0_3(E,R),sk0_5(E,R)) ) ) ),
inference(skolemization,[status(esa)],[f82]) ).
fof(f84,plain,
! [X0,X1] :
( ~ order(X0,X1)
| pd0_0(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f83]) ).
fof(f102,plain,
! [R,E,M] :
( upper_bound(M,R,E)
<=> ! [X] :
( ~ member(X,E)
| apply(R,X,M) ) ),
inference(pre_NNF_transformation,[status(esa)],[f14]) ).
fof(f103,plain,
! [R,E,M] :
( ( ~ upper_bound(M,R,E)
| ! [X] :
( ~ member(X,E)
| apply(R,X,M) ) )
& ( upper_bound(M,R,E)
| ? [X] :
( member(X,E)
& ~ apply(R,X,M) ) ) ),
inference(NNF_transformation,[status(esa)],[f102]) ).
fof(f104,plain,
( ! [R,E,M] :
( ~ upper_bound(M,R,E)
| ! [X] :
( ~ member(X,E)
| apply(R,X,M) ) )
& ! [R,E,M] :
( upper_bound(M,R,E)
| ? [X] :
( member(X,E)
& ~ apply(R,X,M) ) ) ),
inference(miniscoping,[status(esa)],[f103]) ).
fof(f105,plain,
( ! [R,E,M] :
( ~ upper_bound(M,R,E)
| ! [X] :
( ~ member(X,E)
| apply(R,X,M) ) )
& ! [R,E,M] :
( upper_bound(M,R,E)
| ( member(sk0_8(M,E,R),E)
& ~ apply(R,sk0_8(M,E,R),M) ) ) ),
inference(skolemization,[status(esa)],[f104]) ).
fof(f106,plain,
! [X0,X1,X2,X3] :
( ~ upper_bound(X0,X1,X2)
| ~ member(X3,X2)
| apply(X1,X3,X0) ),
inference(cnf_transformation,[status(esa)],[f105]) ).
fof(f107,plain,
! [X0,X1,X2] :
( upper_bound(X0,X1,X2)
| member(sk0_8(X0,X2,X1),X2) ),
inference(cnf_transformation,[status(esa)],[f105]) ).
fof(f108,plain,
! [X0,X1,X2] :
( upper_bound(X0,X1,X2)
| ~ apply(X1,sk0_8(X0,X2,X1),X0) ),
inference(cnf_transformation,[status(esa)],[f105]) ).
fof(f150,plain,
! [A,X,R,E] :
( least_upper_bound(A,X,R,E)
<=> ( member(A,X)
& upper_bound(A,R,X)
& ! [M] :
( ~ member(M,E)
| ~ upper_bound(M,R,X)
| apply(R,A,M) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f20]) ).
fof(f151,plain,
! [A,X,R,E] :
( ( ~ least_upper_bound(A,X,R,E)
| ( member(A,X)
& upper_bound(A,R,X)
& ! [M] :
( ~ member(M,E)
| ~ upper_bound(M,R,X)
| apply(R,A,M) ) ) )
& ( least_upper_bound(A,X,R,E)
| ~ member(A,X)
| ~ upper_bound(A,R,X)
| ? [M] :
( member(M,E)
& upper_bound(M,R,X)
& ~ apply(R,A,M) ) ) ),
inference(NNF_transformation,[status(esa)],[f150]) ).
fof(f152,plain,
( ! [A,X,R,E] :
( ~ least_upper_bound(A,X,R,E)
| ( member(A,X)
& upper_bound(A,R,X)
& ! [M] :
( ~ member(M,E)
| ~ upper_bound(M,R,X)
| apply(R,A,M) ) ) )
& ! [A,X,R,E] :
( least_upper_bound(A,X,R,E)
| ~ member(A,X)
| ~ upper_bound(A,R,X)
| ? [M] :
( member(M,E)
& upper_bound(M,R,X)
& ~ apply(R,A,M) ) ) ),
inference(miniscoping,[status(esa)],[f151]) ).
fof(f153,plain,
( ! [A,X,R,E] :
( ~ least_upper_bound(A,X,R,E)
| ( member(A,X)
& upper_bound(A,R,X)
& ! [M] :
( ~ member(M,E)
| ~ upper_bound(M,R,X)
| apply(R,A,M) ) ) )
& ! [A,X,R,E] :
( least_upper_bound(A,X,R,E)
| ~ member(A,X)
| ~ upper_bound(A,R,X)
| ( member(sk0_14(E,R,X,A),E)
& upper_bound(sk0_14(E,R,X,A),R,X)
& ~ apply(R,A,sk0_14(E,R,X,A)) ) ) ),
inference(skolemization,[status(esa)],[f152]) ).
fof(f158,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ upper_bound(X0,X2,X1)
| upper_bound(sk0_14(X3,X2,X1,X0),X2,X1) ),
inference(cnf_transformation,[status(esa)],[f153]) ).
fof(f159,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ upper_bound(X0,X2,X1)
| ~ apply(X2,X0,sk0_14(X3,X2,X1,X0)) ),
inference(cnf_transformation,[status(esa)],[f153]) ).
fof(f170,plain,
? [R,E,A,B] :
( order(R,E)
& member(A,E)
& member(B,E)
& apply(R,A,B)
& ~ least_upper_bound(B,unordered_pair(A,B),R,E) ),
inference(pre_NNF_transformation,[status(esa)],[f23]) ).
fof(f171,plain,
( order(sk0_16,sk0_17)
& member(sk0_18,sk0_17)
& member(sk0_19,sk0_17)
& apply(sk0_16,sk0_18,sk0_19)
& ~ least_upper_bound(sk0_19,unordered_pair(sk0_18,sk0_19),sk0_16,sk0_17) ),
inference(skolemization,[status(esa)],[f170]) ).
fof(f172,plain,
order(sk0_16,sk0_17),
inference(cnf_transformation,[status(esa)],[f171]) ).
fof(f174,plain,
member(sk0_19,sk0_17),
inference(cnf_transformation,[status(esa)],[f171]) ).
fof(f175,plain,
apply(sk0_16,sk0_18,sk0_19),
inference(cnf_transformation,[status(esa)],[f171]) ).
fof(f176,plain,
~ least_upper_bound(sk0_19,unordered_pair(sk0_18,sk0_19),sk0_16,sk0_17),
inference(cnf_transformation,[status(esa)],[f171]) ).
fof(f177,plain,
! [R,E,X] :
( pd0_1(X,E,R)
<=> ( ~ member(X,E)
| apply(R,X,X) ) ),
introduced(predicate_definition,[f79]) ).
fof(f178,plain,
! [R,E] :
( pd0_0(E,R)
<=> ( ! [X] : pd0_1(X,E,R)
& ! [X,Y] :
( ~ member(X,E)
| ~ member(Y,E)
| ~ apply(R,X,Y)
| ~ apply(R,Y,X)
| X = Y ) ) ),
inference(formula_renaming,[status(thm)],[f79,f177]) ).
fof(f179,plain,
! [R,E] :
( ( ~ pd0_0(E,R)
| ( ! [X] : pd0_1(X,E,R)
& ! [X,Y] :
( ~ member(X,E)
| ~ member(Y,E)
| ~ apply(R,X,Y)
| ~ apply(R,Y,X)
| X = Y ) ) )
& ( pd0_0(E,R)
| ? [X] : ~ pd0_1(X,E,R)
| ? [X,Y] :
( member(X,E)
& member(Y,E)
& apply(R,X,Y)
& apply(R,Y,X)
& X != Y ) ) ),
inference(NNF_transformation,[status(esa)],[f178]) ).
fof(f180,plain,
( ! [R,E] :
( ~ pd0_0(E,R)
| ( ! [X] : pd0_1(X,E,R)
& ! [X,Y] :
( ~ member(X,E)
| ~ member(Y,E)
| ~ apply(R,X,Y)
| ~ apply(R,Y,X)
| X = Y ) ) )
& ! [R,E] :
( pd0_0(E,R)
| ? [X] : ~ pd0_1(X,E,R)
| ? [X,Y] :
( member(X,E)
& member(Y,E)
& apply(R,X,Y)
& apply(R,Y,X)
& X != Y ) ) ),
inference(miniscoping,[status(esa)],[f179]) ).
fof(f181,plain,
( ! [R,E] :
( ~ pd0_0(E,R)
| ( ! [X] : pd0_1(X,E,R)
& ! [X,Y] :
( ~ member(X,E)
| ~ member(Y,E)
| ~ apply(R,X,Y)
| ~ apply(R,Y,X)
| X = Y ) ) )
& ! [R,E] :
( pd0_0(E,R)
| ~ pd0_1(sk0_20(E,R),E,R)
| ( member(sk0_21(E,R),E)
& member(sk0_22(E,R),E)
& apply(R,sk0_21(E,R),sk0_22(E,R))
& apply(R,sk0_22(E,R),sk0_21(E,R))
& sk0_21(E,R) != sk0_22(E,R) ) ) ),
inference(skolemization,[status(esa)],[f180]) ).
fof(f182,plain,
! [X0,X1,X2] :
( ~ pd0_0(X0,X1)
| pd0_1(X2,X0,X1) ),
inference(cnf_transformation,[status(esa)],[f181]) ).
fof(f189,plain,
! [R,E,X] :
( ( ~ pd0_1(X,E,R)
| ~ member(X,E)
| apply(R,X,X) )
& ( pd0_1(X,E,R)
| ( member(X,E)
& ~ apply(R,X,X) ) ) ),
inference(NNF_transformation,[status(esa)],[f177]) ).
fof(f190,plain,
( ! [R,E,X] :
( ~ pd0_1(X,E,R)
| ~ member(X,E)
| apply(R,X,X) )
& ! [R,E,X] :
( pd0_1(X,E,R)
| ( member(X,E)
& ~ apply(R,X,X) ) ) ),
inference(miniscoping,[status(esa)],[f189]) ).
fof(f191,plain,
! [X0,X1,X2] :
( ~ pd0_1(X0,X1,X2)
| ~ member(X0,X1)
| apply(X2,X0,X0) ),
inference(cnf_transformation,[status(esa)],[f190]) ).
fof(f196,plain,
! [X0,X1] : member(X0,unordered_pair(X1,X0)),
inference(destructive_equality_resolution,[status(esa)],[f64]) ).
fof(f2169,plain,
! [X0,X1,X2,X3] :
( upper_bound(X0,X1,unordered_pair(X2,X3))
| sk0_8(X0,unordered_pair(X2,X3),X1) = X2
| sk0_8(X0,unordered_pair(X2,X3),X1) = X3 ),
inference(resolution,[status(thm)],[f107,f62]) ).
fof(f3301,plain,
( spl0_180
<=> member(sk0_19,sk0_17) ),
introduced(split_symbol_definition) ).
fof(f3303,plain,
( ~ member(sk0_19,sk0_17)
| spl0_180 ),
inference(component_clause,[status(thm)],[f3301]) ).
fof(f3337,plain,
( $false
| spl0_180 ),
inference(forward_subsumption_resolution,[status(thm)],[f3303,f174]) ).
fof(f3338,plain,
spl0_180,
inference(contradiction_clause,[status(thm)],[f3337]) ).
fof(f3345,plain,
( spl0_189
<=> apply(sk0_16,sk0_18,sk0_19) ),
introduced(split_symbol_definition) ).
fof(f3347,plain,
( ~ apply(sk0_16,sk0_18,sk0_19)
| spl0_189 ),
inference(component_clause,[status(thm)],[f3345]) ).
fof(f3377,plain,
( spl0_193
<=> apply(sk0_16,sk0_19,sk0_19) ),
introduced(split_symbol_definition) ).
fof(f3379,plain,
( ~ apply(sk0_16,sk0_19,sk0_19)
| spl0_193 ),
inference(component_clause,[status(thm)],[f3377]) ).
fof(f4136,plain,
! [X0,X1,X2,X3,X4] :
( least_upper_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ upper_bound(X0,X2,X1)
| ~ upper_bound(sk0_14(X3,X2,X1,X0),X2,X4)
| ~ member(X0,X4) ),
inference(resolution,[status(thm)],[f159,f106]) ).
fof(f4550,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1)
| least_upper_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ upper_bound(X0,X2,X1) ),
inference(resolution,[status(thm)],[f4136,f158]) ).
fof(f4551,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ upper_bound(X0,X2,X1) ),
inference(duplicate_literals_removal,[status(esa)],[f4550]) ).
fof(f4557,plain,
( spl0_245
<=> member(sk0_19,unordered_pair(sk0_18,sk0_19)) ),
introduced(split_symbol_definition) ).
fof(f4559,plain,
( ~ member(sk0_19,unordered_pair(sk0_18,sk0_19))
| spl0_245 ),
inference(component_clause,[status(thm)],[f4557]) ).
fof(f4560,plain,
( spl0_246
<=> upper_bound(sk0_19,sk0_16,unordered_pair(sk0_18,sk0_19)) ),
introduced(split_symbol_definition) ).
fof(f4562,plain,
( ~ upper_bound(sk0_19,sk0_16,unordered_pair(sk0_18,sk0_19))
| spl0_246 ),
inference(component_clause,[status(thm)],[f4560]) ).
fof(f4563,plain,
( ~ member(sk0_19,unordered_pair(sk0_18,sk0_19))
| ~ upper_bound(sk0_19,sk0_16,unordered_pair(sk0_18,sk0_19)) ),
inference(resolution,[status(thm)],[f4551,f176]) ).
fof(f4564,plain,
( ~ spl0_245
| ~ spl0_246 ),
inference(split_clause,[status(thm)],[f4563,f4557,f4560]) ).
fof(f4567,plain,
( $false
| spl0_245 ),
inference(forward_subsumption_resolution,[status(thm)],[f4559,f196]) ).
fof(f4568,plain,
spl0_245,
inference(contradiction_clause,[status(thm)],[f4567]) ).
fof(f4957,plain,
( spl0_253
<=> sk0_8(sk0_19,unordered_pair(sk0_18,sk0_19),sk0_16) = sk0_18 ),
introduced(split_symbol_definition) ).
fof(f4958,plain,
( sk0_8(sk0_19,unordered_pair(sk0_18,sk0_19),sk0_16) = sk0_18
| ~ spl0_253 ),
inference(component_clause,[status(thm)],[f4957]) ).
fof(f4960,plain,
( spl0_254
<=> sk0_8(sk0_19,unordered_pair(sk0_18,sk0_19),sk0_16) = sk0_19 ),
introduced(split_symbol_definition) ).
fof(f4961,plain,
( sk0_8(sk0_19,unordered_pair(sk0_18,sk0_19),sk0_16) = sk0_19
| ~ spl0_254 ),
inference(component_clause,[status(thm)],[f4960]) ).
fof(f4963,plain,
( sk0_8(sk0_19,unordered_pair(sk0_18,sk0_19),sk0_16) = sk0_18
| sk0_8(sk0_19,unordered_pair(sk0_18,sk0_19),sk0_16) = sk0_19
| spl0_246 ),
inference(resolution,[status(thm)],[f2169,f4562]) ).
fof(f4964,plain,
( spl0_253
| spl0_254
| spl0_246 ),
inference(split_clause,[status(thm)],[f4963,f4957,f4960,f4560]) ).
fof(f5060,plain,
( upper_bound(sk0_19,sk0_16,unordered_pair(sk0_18,sk0_19))
| ~ apply(sk0_16,sk0_18,sk0_19)
| ~ spl0_253 ),
inference(paramodulation,[status(thm)],[f4958,f108]) ).
fof(f5061,plain,
( spl0_246
| ~ spl0_189
| ~ spl0_253 ),
inference(split_clause,[status(thm)],[f5060,f4560,f3345,f4957]) ).
fof(f5062,plain,
( $false
| spl0_189 ),
inference(forward_subsumption_resolution,[status(thm)],[f3347,f175]) ).
fof(f5063,plain,
spl0_189,
inference(contradiction_clause,[status(thm)],[f5062]) ).
fof(f5066,plain,
( upper_bound(sk0_19,sk0_16,unordered_pair(sk0_18,sk0_19))
| ~ apply(sk0_16,sk0_19,sk0_19)
| ~ spl0_254 ),
inference(paramodulation,[status(thm)],[f4961,f108]) ).
fof(f5067,plain,
( spl0_246
| ~ spl0_193
| ~ spl0_254 ),
inference(split_clause,[status(thm)],[f5066,f4560,f3377,f4960]) ).
fof(f5068,plain,
! [X0] :
( ~ pd0_1(sk0_19,X0,sk0_16)
| ~ member(sk0_19,X0)
| spl0_193 ),
inference(resolution,[status(thm)],[f3379,f191]) ).
fof(f5074,plain,
! [X0] :
( ~ member(sk0_19,X0)
| ~ pd0_0(X0,sk0_16)
| spl0_193 ),
inference(resolution,[status(thm)],[f5068,f182]) ).
fof(f5075,plain,
! [X0] :
( ~ member(sk0_19,X0)
| ~ order(sk0_16,X0)
| spl0_193 ),
inference(resolution,[status(thm)],[f5074,f84]) ).
fof(f5077,plain,
( ~ member(sk0_19,sk0_17)
| spl0_193 ),
inference(resolution,[status(thm)],[f5075,f172]) ).
fof(f5078,plain,
( ~ spl0_180
| spl0_193 ),
inference(split_clause,[status(thm)],[f5077,f3301,f3377]) ).
fof(f5079,plain,
$false,
inference(sat_refutation,[status(thm)],[f3338,f4564,f4568,f4964,f5061,f5063,f5067,f5078]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET795+4 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Apr 29 21:29:28 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.37 % Drodi V3.6.0
% 11.32/1.80 % Refutation found
% 11.32/1.80 % SZS status Theorem for theBenchmark: Theorem is valid
% 11.32/1.80 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 11.32/1.84 % Elapsed time: 1.468541 seconds
% 11.32/1.84 % CPU time: 11.425591 seconds
% 11.32/1.84 % Total memory used: 128.756 MB
% 11.32/1.84 % Net memory used: 123.945 MB
%------------------------------------------------------------------------------