TSTP Solution File: SEU270+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SEU270+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n004.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:36:32 EDT 2023
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 8
% Syntax : Number of formulae : 70 ( 7 unt; 0 def)
% Number of atoms : 330 ( 29 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 443 ( 183 ~; 194 |; 46 &)
% ( 10 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 142 (; 133 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [A,B] :
( ( ordinal(A)
& ordinal(B) )
=> ( ordinal_subset(A,B)
| ordinal_subset(B,A) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [A] :
( relation(A)
=> ( connected(A)
<=> is_connected_in(A,relation_field(A)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [A,B] :
( relation(B)
=> ( B = inclusion_relation(A)
<=> ( relation_field(B) = A
& ! [C,D] :
( ( in(C,A)
& in(D,A) )
=> ( in(ordered_pair(C,D),B)
<=> subset(C,D) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,axiom,
! [A] :
( relation(A)
=> ! [B] :
( is_connected_in(A,B)
<=> ! [C,D] :
~ ( in(C,B)
& in(D,B)
& C != D
& ~ in(ordered_pair(C,D),A)
& ~ in(ordered_pair(D,C),A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,axiom,
! [A] : relation(inclusion_relation(A)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f42,axiom,
! [A,B] :
( ( ordinal(A)
& ordinal(B) )
=> ( ordinal_subset(A,B)
<=> subset(A,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f47,axiom,
! [A,B] :
( ordinal(B)
=> ( in(A,B)
=> ordinal(A) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f51,conjecture,
! [A] :
( ordinal(A)
=> connected(inclusion_relation(A)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f52,negated_conjecture,
~ ! [A] :
( ordinal(A)
=> connected(inclusion_relation(A)) ),
inference(negated_conjecture,[status(cth)],[f51]) ).
fof(f76,plain,
! [A,B] :
( ~ ordinal(A)
| ~ ordinal(B)
| ordinal_subset(A,B)
| ordinal_subset(B,A) ),
inference(pre_NNF_transformation,[status(esa)],[f9]) ).
fof(f77,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| ordinal_subset(X0,X1)
| ordinal_subset(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f76]) ).
fof(f78,plain,
! [A] :
( ~ relation(A)
| ( connected(A)
<=> is_connected_in(A,relation_field(A)) ) ),
inference(pre_NNF_transformation,[status(esa)],[f10]) ).
fof(f79,plain,
! [A] :
( ~ relation(A)
| ( ( ~ connected(A)
| is_connected_in(A,relation_field(A)) )
& ( connected(A)
| ~ is_connected_in(A,relation_field(A)) ) ) ),
inference(NNF_transformation,[status(esa)],[f78]) ).
fof(f81,plain,
! [X0] :
( ~ relation(X0)
| connected(X0)
| ~ is_connected_in(X0,relation_field(X0)) ),
inference(cnf_transformation,[status(esa)],[f79]) ).
fof(f82,plain,
! [A,B] :
( ~ relation(B)
| ( B = inclusion_relation(A)
<=> ( relation_field(B) = A
& ! [C,D] :
( ~ in(C,A)
| ~ in(D,A)
| ( in(ordered_pair(C,D),B)
<=> subset(C,D) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f11]) ).
fof(f83,plain,
! [A,B] :
( ~ relation(B)
| ( ( B != inclusion_relation(A)
| ( relation_field(B) = A
& ! [C,D] :
( ~ in(C,A)
| ~ in(D,A)
| ( ( ~ in(ordered_pair(C,D),B)
| subset(C,D) )
& ( in(ordered_pair(C,D),B)
| ~ subset(C,D) ) ) ) ) )
& ( B = inclusion_relation(A)
| relation_field(B) != A
| ? [C,D] :
( in(C,A)
& in(D,A)
& ( ~ in(ordered_pair(C,D),B)
| ~ subset(C,D) )
& ( in(ordered_pair(C,D),B)
| subset(C,D) ) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f82]) ).
fof(f84,plain,
! [B] :
( ~ relation(B)
| ( ! [A] :
( B != inclusion_relation(A)
| ( relation_field(B) = A
& ! [C,D] :
( ~ in(C,A)
| ~ in(D,A)
| ( ( ~ in(ordered_pair(C,D),B)
| subset(C,D) )
& ( in(ordered_pair(C,D),B)
| ~ subset(C,D) ) ) ) ) )
& ! [A] :
( B = inclusion_relation(A)
| relation_field(B) != A
| ? [C,D] :
( in(C,A)
& in(D,A)
& ( ~ in(ordered_pair(C,D),B)
| ~ subset(C,D) )
& ( in(ordered_pair(C,D),B)
| subset(C,D) ) ) ) ) ),
inference(miniscoping,[status(esa)],[f83]) ).
fof(f85,plain,
! [B] :
( ~ relation(B)
| ( ! [A] :
( B != inclusion_relation(A)
| ( relation_field(B) = A
& ! [C,D] :
( ~ in(C,A)
| ~ in(D,A)
| ( ( ~ in(ordered_pair(C,D),B)
| subset(C,D) )
& ( in(ordered_pair(C,D),B)
| ~ subset(C,D) ) ) ) ) )
& ! [A] :
( B = inclusion_relation(A)
| relation_field(B) != A
| ( in(sk0_0(A,B),A)
& in(sk0_1(A,B),A)
& ( ~ in(ordered_pair(sk0_0(A,B),sk0_1(A,B)),B)
| ~ subset(sk0_0(A,B),sk0_1(A,B)) )
& ( in(ordered_pair(sk0_0(A,B),sk0_1(A,B)),B)
| subset(sk0_0(A,B),sk0_1(A,B)) ) ) ) ) ),
inference(skolemization,[status(esa)],[f84]) ).
fof(f86,plain,
! [X0,X1] :
( ~ relation(X0)
| X0 != inclusion_relation(X1)
| relation_field(X0) = X1 ),
inference(cnf_transformation,[status(esa)],[f85]) ).
fof(f88,plain,
! [X0,X1,X2,X3] :
( ~ relation(X0)
| X0 != inclusion_relation(X1)
| ~ in(X2,X1)
| ~ in(X3,X1)
| in(ordered_pair(X2,X3),X0)
| ~ subset(X2,X3) ),
inference(cnf_transformation,[status(esa)],[f85]) ).
fof(f96,plain,
! [A] :
( ~ relation(A)
| ! [B] :
( is_connected_in(A,B)
<=> ! [C,D] :
( ~ in(C,B)
| ~ in(D,B)
| C = D
| in(ordered_pair(C,D),A)
| in(ordered_pair(D,C),A) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f14]) ).
fof(f97,plain,
! [A] :
( ~ relation(A)
| ! [B] :
( ( ~ is_connected_in(A,B)
| ! [C,D] :
( ~ in(C,B)
| ~ in(D,B)
| C = D
| in(ordered_pair(C,D),A)
| in(ordered_pair(D,C),A) ) )
& ( is_connected_in(A,B)
| ? [C,D] :
( in(C,B)
& in(D,B)
& C != D
& ~ in(ordered_pair(C,D),A)
& ~ in(ordered_pair(D,C),A) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f96]) ).
fof(f98,plain,
! [A] :
( ~ relation(A)
| ( ! [B] :
( ~ is_connected_in(A,B)
| ! [C,D] :
( ~ in(C,B)
| ~ in(D,B)
| C = D
| in(ordered_pair(C,D),A)
| in(ordered_pair(D,C),A) ) )
& ! [B] :
( is_connected_in(A,B)
| ? [C,D] :
( in(C,B)
& in(D,B)
& C != D
& ~ in(ordered_pair(C,D),A)
& ~ in(ordered_pair(D,C),A) ) ) ) ),
inference(miniscoping,[status(esa)],[f97]) ).
fof(f99,plain,
! [A] :
( ~ relation(A)
| ( ! [B] :
( ~ is_connected_in(A,B)
| ! [C,D] :
( ~ in(C,B)
| ~ in(D,B)
| C = D
| in(ordered_pair(C,D),A)
| in(ordered_pair(D,C),A) ) )
& ! [B] :
( is_connected_in(A,B)
| ( in(sk0_2(B,A),B)
& in(sk0_3(B,A),B)
& sk0_2(B,A) != sk0_3(B,A)
& ~ in(ordered_pair(sk0_2(B,A),sk0_3(B,A)),A)
& ~ in(ordered_pair(sk0_3(B,A),sk0_2(B,A)),A) ) ) ) ),
inference(skolemization,[status(esa)],[f98]) ).
fof(f101,plain,
! [X0,X1] :
( ~ relation(X0)
| is_connected_in(X0,X1)
| in(sk0_2(X1,X0),X1) ),
inference(cnf_transformation,[status(esa)],[f99]) ).
fof(f102,plain,
! [X0,X1] :
( ~ relation(X0)
| is_connected_in(X0,X1)
| in(sk0_3(X1,X0),X1) ),
inference(cnf_transformation,[status(esa)],[f99]) ).
fof(f104,plain,
! [X0,X1] :
( ~ relation(X0)
| is_connected_in(X0,X1)
| ~ in(ordered_pair(sk0_2(X1,X0),sk0_3(X1,X0)),X0) ),
inference(cnf_transformation,[status(esa)],[f99]) ).
fof(f105,plain,
! [X0,X1] :
( ~ relation(X0)
| is_connected_in(X0,X1)
| ~ in(ordered_pair(sk0_3(X1,X0),sk0_2(X1,X0)),X0) ),
inference(cnf_transformation,[status(esa)],[f99]) ).
fof(f106,plain,
! [X0] : relation(inclusion_relation(X0)),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f163,plain,
! [A,B] :
( ~ ordinal(A)
| ~ ordinal(B)
| ( ordinal_subset(A,B)
<=> subset(A,B) ) ),
inference(pre_NNF_transformation,[status(esa)],[f42]) ).
fof(f164,plain,
! [A,B] :
( ~ ordinal(A)
| ~ ordinal(B)
| ( ( ~ ordinal_subset(A,B)
| subset(A,B) )
& ( ordinal_subset(A,B)
| ~ subset(A,B) ) ) ),
inference(NNF_transformation,[status(esa)],[f163]) ).
fof(f165,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| ~ ordinal_subset(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f164]) ).
fof(f175,plain,
! [A,B] :
( ~ ordinal(B)
| ~ in(A,B)
| ordinal(A) ),
inference(pre_NNF_transformation,[status(esa)],[f47]) ).
fof(f176,plain,
! [B] :
( ~ ordinal(B)
| ! [A] :
( ~ in(A,B)
| ordinal(A) ) ),
inference(miniscoping,[status(esa)],[f175]) ).
fof(f177,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ in(X1,X0)
| ordinal(X1) ),
inference(cnf_transformation,[status(esa)],[f176]) ).
fof(f187,plain,
? [A] :
( ordinal(A)
& ~ connected(inclusion_relation(A)) ),
inference(pre_NNF_transformation,[status(esa)],[f52]) ).
fof(f188,plain,
( ordinal(sk0_14)
& ~ connected(inclusion_relation(sk0_14)) ),
inference(skolemization,[status(esa)],[f187]) ).
fof(f189,plain,
ordinal(sk0_14),
inference(cnf_transformation,[status(esa)],[f188]) ).
fof(f190,plain,
~ connected(inclusion_relation(sk0_14)),
inference(cnf_transformation,[status(esa)],[f188]) ).
fof(f209,plain,
! [X0] :
( ~ relation(inclusion_relation(X0))
| relation_field(inclusion_relation(X0)) = X0 ),
inference(destructive_equality_resolution,[status(esa)],[f86]) ).
fof(f211,plain,
! [X0,X1,X2] :
( ~ relation(inclusion_relation(X0))
| ~ in(X1,X0)
| ~ in(X2,X0)
| in(ordered_pair(X1,X2),inclusion_relation(X0))
| ~ subset(X1,X2) ),
inference(destructive_equality_resolution,[status(esa)],[f88]) ).
fof(f217,plain,
! [X0,X1,X2] :
( ~ in(X0,X1)
| ~ in(X2,X1)
| in(ordered_pair(X0,X2),inclusion_relation(X1))
| ~ subset(X0,X2) ),
inference(forward_subsumption_resolution,[status(thm)],[f211,f106]) ).
fof(f379,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0)
| ordinal_subset(X1,X0) ),
inference(resolution,[status(thm)],[f165,f77]) ).
fof(f380,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| subset(X0,X1)
| ordinal_subset(X1,X0) ),
inference(duplicate_literals_removal,[status(esa)],[f379]) ).
fof(f407,plain,
! [X0,X1] :
( ~ relation(inclusion_relation(X0))
| is_connected_in(inclusion_relation(X0),X1)
| ~ in(sk0_2(X1,inclusion_relation(X0)),X0)
| ~ in(sk0_3(X1,inclusion_relation(X0)),X0)
| ~ subset(sk0_2(X1,inclusion_relation(X0)),sk0_3(X1,inclusion_relation(X0))) ),
inference(resolution,[status(thm)],[f104,f217]) ).
fof(f408,plain,
! [X0,X1] :
( is_connected_in(inclusion_relation(X0),X1)
| ~ in(sk0_2(X1,inclusion_relation(X0)),X0)
| ~ in(sk0_3(X1,inclusion_relation(X0)),X0)
| ~ subset(sk0_2(X1,inclusion_relation(X0)),sk0_3(X1,inclusion_relation(X0))) ),
inference(forward_subsumption_resolution,[status(thm)],[f407,f106]) ).
fof(f409,plain,
! [X0,X1] :
( is_connected_in(inclusion_relation(X0),X1)
| ~ in(sk0_2(X1,inclusion_relation(X0)),X0)
| ~ in(sk0_3(X1,inclusion_relation(X0)),X0)
| ~ ordinal(sk0_2(X1,inclusion_relation(X0)))
| ~ ordinal(sk0_3(X1,inclusion_relation(X0)))
| ordinal_subset(sk0_3(X1,inclusion_relation(X0)),sk0_2(X1,inclusion_relation(X0))) ),
inference(resolution,[status(thm)],[f408,f380]) ).
fof(f410,plain,
! [X0,X1] :
( is_connected_in(inclusion_relation(X0),X1)
| ~ in(sk0_2(X1,inclusion_relation(X0)),X0)
| ~ in(sk0_3(X1,inclusion_relation(X0)),X0)
| ~ ordinal(sk0_2(X1,inclusion_relation(X0)))
| ~ ordinal(sk0_3(X1,inclusion_relation(X0)))
| ~ ordinal(sk0_3(X1,inclusion_relation(X0)))
| ~ ordinal(sk0_2(X1,inclusion_relation(X0)))
| subset(sk0_3(X1,inclusion_relation(X0)),sk0_2(X1,inclusion_relation(X0))) ),
inference(resolution,[status(thm)],[f409,f165]) ).
fof(f411,plain,
! [X0,X1] :
( is_connected_in(inclusion_relation(X0),X1)
| ~ in(sk0_2(X1,inclusion_relation(X0)),X0)
| ~ in(sk0_3(X1,inclusion_relation(X0)),X0)
| ~ ordinal(sk0_2(X1,inclusion_relation(X0)))
| ~ ordinal(sk0_3(X1,inclusion_relation(X0)))
| subset(sk0_3(X1,inclusion_relation(X0)),sk0_2(X1,inclusion_relation(X0))) ),
inference(duplicate_literals_removal,[status(esa)],[f410]) ).
fof(f415,plain,
! [X0,X1] :
( ~ relation(inclusion_relation(X0))
| is_connected_in(inclusion_relation(X0),X1)
| ~ in(sk0_3(X1,inclusion_relation(X0)),X0)
| ~ in(sk0_2(X1,inclusion_relation(X0)),X0)
| ~ subset(sk0_3(X1,inclusion_relation(X0)),sk0_2(X1,inclusion_relation(X0))) ),
inference(resolution,[status(thm)],[f105,f217]) ).
fof(f416,plain,
! [X0,X1] :
( is_connected_in(inclusion_relation(X0),X1)
| ~ in(sk0_3(X1,inclusion_relation(X0)),X0)
| ~ in(sk0_2(X1,inclusion_relation(X0)),X0)
| ~ subset(sk0_3(X1,inclusion_relation(X0)),sk0_2(X1,inclusion_relation(X0))) ),
inference(forward_subsumption_resolution,[status(thm)],[f415,f106]) ).
fof(f417,plain,
! [X0,X1] :
( is_connected_in(inclusion_relation(X0),X1)
| ~ in(sk0_2(X1,inclusion_relation(X0)),X0)
| ~ in(sk0_3(X1,inclusion_relation(X0)),X0)
| ~ ordinal(sk0_2(X1,inclusion_relation(X0)))
| ~ ordinal(sk0_3(X1,inclusion_relation(X0))) ),
inference(backward_subsumption_resolution,[status(thm)],[f411,f416]) ).
fof(f419,plain,
! [X0] : relation_field(inclusion_relation(X0)) = X0,
inference(forward_subsumption_resolution,[status(thm)],[f209,f106]) ).
fof(f420,plain,
! [X0] :
( ~ relation(inclusion_relation(X0))
| connected(inclusion_relation(X0))
| ~ is_connected_in(inclusion_relation(X0),X0) ),
inference(paramodulation,[status(thm)],[f419,f81]) ).
fof(f421,plain,
! [X0] :
( connected(inclusion_relation(X0))
| ~ is_connected_in(inclusion_relation(X0),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f420,f106]) ).
fof(f609,plain,
! [X0,X1] :
( ~ relation(X0)
| is_connected_in(X0,X1)
| ~ ordinal(X1)
| ordinal(sk0_2(X1,X0)) ),
inference(resolution,[status(thm)],[f101,f177]) ).
fof(f610,plain,
! [X0] :
( ~ relation(inclusion_relation(X0))
| is_connected_in(inclusion_relation(X0),X0)
| is_connected_in(inclusion_relation(X0),X0)
| ~ in(sk0_2(X0,inclusion_relation(X0)),X0)
| ~ ordinal(sk0_2(X0,inclusion_relation(X0)))
| ~ ordinal(sk0_3(X0,inclusion_relation(X0))) ),
inference(resolution,[status(thm)],[f102,f417]) ).
fof(f611,plain,
! [X0] :
( ~ relation(inclusion_relation(X0))
| is_connected_in(inclusion_relation(X0),X0)
| ~ in(sk0_2(X0,inclusion_relation(X0)),X0)
| ~ ordinal(sk0_2(X0,inclusion_relation(X0)))
| ~ ordinal(sk0_3(X0,inclusion_relation(X0))) ),
inference(duplicate_literals_removal,[status(esa)],[f610]) ).
fof(f612,plain,
! [X0] :
( is_connected_in(inclusion_relation(X0),X0)
| ~ in(sk0_2(X0,inclusion_relation(X0)),X0)
| ~ ordinal(sk0_2(X0,inclusion_relation(X0)))
| ~ ordinal(sk0_3(X0,inclusion_relation(X0))) ),
inference(forward_subsumption_resolution,[status(thm)],[f611,f106]) ).
fof(f620,plain,
! [X0,X1] :
( ~ relation(X0)
| is_connected_in(X0,X1)
| ~ ordinal(X1)
| ordinal(sk0_3(X1,X0)) ),
inference(resolution,[status(thm)],[f102,f177]) ).
fof(f721,plain,
! [X0] :
( is_connected_in(inclusion_relation(X0),X0)
| ~ ordinal(sk0_2(X0,inclusion_relation(X0)))
| ~ ordinal(sk0_3(X0,inclusion_relation(X0)))
| ~ relation(inclusion_relation(X0))
| is_connected_in(inclusion_relation(X0),X0) ),
inference(resolution,[status(thm)],[f612,f101]) ).
fof(f722,plain,
! [X0] :
( is_connected_in(inclusion_relation(X0),X0)
| ~ ordinal(sk0_2(X0,inclusion_relation(X0)))
| ~ ordinal(sk0_3(X0,inclusion_relation(X0)))
| ~ relation(inclusion_relation(X0)) ),
inference(duplicate_literals_removal,[status(esa)],[f721]) ).
fof(f723,plain,
! [X0] :
( is_connected_in(inclusion_relation(X0),X0)
| ~ ordinal(sk0_2(X0,inclusion_relation(X0)))
| ~ ordinal(sk0_3(X0,inclusion_relation(X0))) ),
inference(forward_subsumption_resolution,[status(thm)],[f722,f106]) ).
fof(f725,plain,
! [X0] :
( is_connected_in(inclusion_relation(X0),X0)
| ~ ordinal(sk0_2(X0,inclusion_relation(X0)))
| ~ relation(inclusion_relation(X0))
| is_connected_in(inclusion_relation(X0),X0)
| ~ ordinal(X0) ),
inference(resolution,[status(thm)],[f723,f620]) ).
fof(f726,plain,
! [X0] :
( is_connected_in(inclusion_relation(X0),X0)
| ~ ordinal(sk0_2(X0,inclusion_relation(X0)))
| ~ relation(inclusion_relation(X0))
| ~ ordinal(X0) ),
inference(duplicate_literals_removal,[status(esa)],[f725]) ).
fof(f727,plain,
! [X0] :
( is_connected_in(inclusion_relation(X0),X0)
| ~ relation(inclusion_relation(X0))
| ~ ordinal(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f726,f609]) ).
fof(f728,plain,
! [X0] :
( is_connected_in(inclusion_relation(X0),X0)
| ~ ordinal(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f727,f106]) ).
fof(f729,plain,
! [X0] :
( ~ ordinal(X0)
| connected(inclusion_relation(X0)) ),
inference(resolution,[status(thm)],[f728,f421]) ).
fof(f730,plain,
~ ordinal(sk0_14),
inference(resolution,[status(thm)],[f729,f190]) ).
fof(f731,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f730,f189]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU270+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.32 % Computer : n004.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue May 30 09:12:37 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.10/0.32 % Drodi V3.5.1
% 0.16/0.44 % Refutation found
% 0.16/0.44 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.44 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.46 % Elapsed time: 0.137005 seconds
% 0.16/0.46 % CPU time: 0.662314 seconds
% 0.16/0.46 % Memory used: 64.741 MB
%------------------------------------------------------------------------------