TSTP Solution File: SEU268+2 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SEU268+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n002.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:41:46 EDT 2024
% Result : Theorem 37.64s 5.15s
% Output : CNFRefutation 37.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 45 ( 12 unt; 0 def)
% Number of atoms : 183 ( 27 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 228 ( 90 ~; 91 |; 33 &)
% ( 9 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 97 ( 90 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [A,B] :
( A = B
<=> ( subset(A,B)
& subset(B,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f29,axiom,
! [A] :
( relation(A)
=> ! [B] :
( is_reflexive_in(A,B)
<=> ! [C] :
( in(C,B)
=> in(ordered_pair(C,C),A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f34,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/sandbox/benchmark/theBenchmark.p') ).
fof(f76,axiom,
! [A] :
( relation(A)
=> ( reflexive(A)
<=> is_reflexive_in(A,relation_field(A)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f86,axiom,
! [A] : relation(inclusion_relation(A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f259,conjecture,
! [A] : reflexive(inclusion_relation(A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f260,negated_conjecture,
~ ! [A] : reflexive(inclusion_relation(A)),
inference(negated_conjecture,[status(cth)],[f259]) ).
fof(f386,plain,
! [A,B] :
( ( A != B
| ( subset(A,B)
& subset(B,A) ) )
& ( A = B
| ~ subset(A,B)
| ~ subset(B,A) ) ),
inference(NNF_transformation,[status(esa)],[f15]) ).
fof(f387,plain,
( ! [A,B] :
( A != B
| ( subset(A,B)
& subset(B,A) ) )
& ! [A,B] :
( A = B
| ~ subset(A,B)
| ~ subset(B,A) ) ),
inference(miniscoping,[status(esa)],[f386]) ).
fof(f388,plain,
! [X0,X1] :
( X0 != X1
| subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f387]) ).
fof(f488,plain,
! [A] :
( ~ relation(A)
| ! [B] :
( is_reflexive_in(A,B)
<=> ! [C] :
( ~ in(C,B)
| in(ordered_pair(C,C),A) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f29]) ).
fof(f489,plain,
! [A] :
( ~ relation(A)
| ! [B] :
( ( ~ is_reflexive_in(A,B)
| ! [C] :
( ~ in(C,B)
| in(ordered_pair(C,C),A) ) )
& ( is_reflexive_in(A,B)
| ? [C] :
( in(C,B)
& ~ in(ordered_pair(C,C),A) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f488]) ).
fof(f490,plain,
! [A] :
( ~ relation(A)
| ( ! [B] :
( ~ is_reflexive_in(A,B)
| ! [C] :
( ~ in(C,B)
| in(ordered_pair(C,C),A) ) )
& ! [B] :
( is_reflexive_in(A,B)
| ? [C] :
( in(C,B)
& ~ in(ordered_pair(C,C),A) ) ) ) ),
inference(miniscoping,[status(esa)],[f489]) ).
fof(f491,plain,
! [A] :
( ~ relation(A)
| ( ! [B] :
( ~ is_reflexive_in(A,B)
| ! [C] :
( ~ in(C,B)
| in(ordered_pair(C,C),A) ) )
& ! [B] :
( is_reflexive_in(A,B)
| ( in(sk0_22(B,A),B)
& ~ in(ordered_pair(sk0_22(B,A),sk0_22(B,A)),A) ) ) ) ),
inference(skolemization,[status(esa)],[f490]) ).
fof(f493,plain,
! [X0,X1] :
( ~ relation(X0)
| is_reflexive_in(X0,X1)
| in(sk0_22(X1,X0),X1) ),
inference(cnf_transformation,[status(esa)],[f491]) ).
fof(f494,plain,
! [X0,X1] :
( ~ relation(X0)
| is_reflexive_in(X0,X1)
| ~ in(ordered_pair(sk0_22(X1,X0),sk0_22(X1,X0)),X0) ),
inference(cnf_transformation,[status(esa)],[f491]) ).
fof(f528,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)],[f34]) ).
fof(f529,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)],[f528]) ).
fof(f530,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)],[f529]) ).
fof(f531,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_28(A,B),A)
& in(sk0_29(A,B),A)
& ( ~ in(ordered_pair(sk0_28(A,B),sk0_29(A,B)),B)
| ~ subset(sk0_28(A,B),sk0_29(A,B)) )
& ( in(ordered_pair(sk0_28(A,B),sk0_29(A,B)),B)
| subset(sk0_28(A,B),sk0_29(A,B)) ) ) ) ) ),
inference(skolemization,[status(esa)],[f530]) ).
fof(f532,plain,
! [X0,X1] :
( ~ relation(X0)
| X0 != inclusion_relation(X1)
| relation_field(X0) = X1 ),
inference(cnf_transformation,[status(esa)],[f531]) ).
fof(f534,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)],[f531]) ).
fof(f830,plain,
! [A] :
( ~ relation(A)
| ( reflexive(A)
<=> is_reflexive_in(A,relation_field(A)) ) ),
inference(pre_NNF_transformation,[status(esa)],[f76]) ).
fof(f831,plain,
! [A] :
( ~ relation(A)
| ( ( ~ reflexive(A)
| is_reflexive_in(A,relation_field(A)) )
& ( reflexive(A)
| ~ is_reflexive_in(A,relation_field(A)) ) ) ),
inference(NNF_transformation,[status(esa)],[f830]) ).
fof(f833,plain,
! [X0] :
( ~ relation(X0)
| reflexive(X0)
| ~ is_reflexive_in(X0,relation_field(X0)) ),
inference(cnf_transformation,[status(esa)],[f831]) ).
fof(f834,plain,
! [X0] : relation(inclusion_relation(X0)),
inference(cnf_transformation,[status(esa)],[f86]) ).
fof(f1317,plain,
? [A] : ~ reflexive(inclusion_relation(A)),
inference(pre_NNF_transformation,[status(esa)],[f260]) ).
fof(f1318,plain,
~ reflexive(inclusion_relation(sk0_119)),
inference(skolemization,[status(esa)],[f1317]) ).
fof(f1319,plain,
~ reflexive(inclusion_relation(sk0_119)),
inference(cnf_transformation,[status(esa)],[f1318]) ).
fof(f1648,plain,
! [X0] : subset(X0,X0),
inference(destructive_equality_resolution,[status(esa)],[f388]) ).
fof(f1682,plain,
! [X0] :
( ~ relation(inclusion_relation(X0))
| relation_field(inclusion_relation(X0)) = X0 ),
inference(destructive_equality_resolution,[status(esa)],[f532]) ).
fof(f1684,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)],[f534]) ).
fof(f1754,plain,
! [X0] : relation_field(inclusion_relation(X0)) = X0,
inference(forward_subsumption_resolution,[status(thm)],[f1682,f834]) ).
fof(f1760,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)],[f1684,f834]) ).
fof(f1761,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ in(X0,X1)
| in(ordered_pair(X0,X0),inclusion_relation(X1)) ),
inference(resolution,[status(thm)],[f1648,f1760]) ).
fof(f1762,plain,
! [X0,X1] :
( ~ in(X0,X1)
| in(ordered_pair(X0,X0),inclusion_relation(X1)) ),
inference(duplicate_literals_removal,[status(esa)],[f1761]) ).
fof(f1933,plain,
! [X0] :
( ~ relation(inclusion_relation(X0))
| reflexive(inclusion_relation(X0))
| ~ is_reflexive_in(inclusion_relation(X0),X0) ),
inference(paramodulation,[status(thm)],[f1754,f833]) ).
fof(f1934,plain,
! [X0] :
( reflexive(inclusion_relation(X0))
| ~ is_reflexive_in(inclusion_relation(X0),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f1933,f834]) ).
fof(f9264,plain,
! [X0,X1] :
( ~ relation(inclusion_relation(X0))
| is_reflexive_in(inclusion_relation(X0),X1)
| ~ in(sk0_22(X1,inclusion_relation(X0)),X0) ),
inference(resolution,[status(thm)],[f494,f1762]) ).
fof(f9265,plain,
! [X0,X1] :
( is_reflexive_in(inclusion_relation(X0),X1)
| ~ in(sk0_22(X1,inclusion_relation(X0)),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f9264,f834]) ).
fof(f9873,plain,
! [X0] :
( is_reflexive_in(inclusion_relation(X0),X0)
| ~ relation(inclusion_relation(X0))
| is_reflexive_in(inclusion_relation(X0),X0) ),
inference(resolution,[status(thm)],[f9265,f493]) ).
fof(f9874,plain,
! [X0] :
( is_reflexive_in(inclusion_relation(X0),X0)
| ~ relation(inclusion_relation(X0)) ),
inference(duplicate_literals_removal,[status(esa)],[f9873]) ).
fof(f9875,plain,
! [X0] : is_reflexive_in(inclusion_relation(X0),X0),
inference(forward_subsumption_resolution,[status(thm)],[f9874,f834]) ).
fof(f11933,plain,
! [X0] : reflexive(inclusion_relation(X0)),
inference(backward_subsumption_resolution,[status(thm)],[f1934,f9875]) ).
fof(f11935,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f1319,f11933]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SEU268+2 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.32 % Computer : n002.cluster.edu
% 0.09/0.32 % Model : x86_64 x86_64
% 0.09/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.32 % Memory : 8042.1875MB
% 0.09/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.32 % CPULimit : 300
% 0.09/0.32 % WCLimit : 300
% 0.09/0.32 % DateTime : Mon Apr 29 20:03:09 EDT 2024
% 0.09/0.32 % CPUTime :
% 0.09/0.35 % Drodi V3.6.0
% 37.64/5.15 % Refutation found
% 37.64/5.15 % SZS status Theorem for theBenchmark: Theorem is valid
% 37.64/5.15 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 43.93/6.45 % Elapsed time: 5.897738 seconds
% 43.93/6.45 % CPU time: 38.336967 seconds
% 43.93/6.45 % Total memory used: 415.576 MB
% 43.93/6.45 % Net memory used: 411.458 MB
%------------------------------------------------------------------------------