TSTP Solution File: SEU261+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SEU261+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n023.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:44 EDT 2024
% Result : Theorem 0.14s 0.35s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 81 ( 13 unt; 0 def)
% Number of atoms : 301 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 368 ( 148 ~; 147 |; 38 &)
% ( 17 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 25 ( 24 usr; 16 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 39 ( 36 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A] :
( relation(A)
=> ( well_ordering(A)
<=> ( reflexive(A)
& transitive(A)
& antisymmetric(A)
& connected(A)
& well_founded_relation(A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A] :
( relation(A)
=> ! [B] :
( relation(B)
=> ! [C] :
( ( relation(C)
& function(C) )
=> ( relation_isomorphism(A,B,C)
=> ( ( reflexive(A)
=> reflexive(B) )
& ( transitive(A)
=> transitive(B) )
& ( connected(A)
=> connected(B) )
& ( antisymmetric(A)
=> antisymmetric(B) )
& ( well_founded_relation(A)
=> well_founded_relation(B) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,conjecture,
! [A] :
( relation(A)
=> ! [B] :
( relation(B)
=> ! [C] :
( ( relation(C)
& function(C) )
=> ( ( well_ordering(A)
& relation_isomorphism(A,B,C) )
=> well_ordering(B) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,negated_conjecture,
~ ! [A] :
( relation(A)
=> ! [B] :
( relation(B)
=> ! [C] :
( ( relation(C)
& function(C) )
=> ( ( well_ordering(A)
& relation_isomorphism(A,B,C) )
=> well_ordering(B) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [A] :
( ~ relation(A)
| ( well_ordering(A)
<=> ( reflexive(A)
& transitive(A)
& antisymmetric(A)
& connected(A)
& well_founded_relation(A) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f1]) ).
fof(f7,plain,
! [A] :
( ~ relation(A)
| ( ( ~ well_ordering(A)
| ( reflexive(A)
& transitive(A)
& antisymmetric(A)
& connected(A)
& well_founded_relation(A) ) )
& ( well_ordering(A)
| ~ reflexive(A)
| ~ transitive(A)
| ~ antisymmetric(A)
| ~ connected(A)
| ~ well_founded_relation(A) ) ) ),
inference(NNF_transformation,[status(esa)],[f6]) ).
fof(f8,plain,
! [X0] :
( ~ relation(X0)
| ~ well_ordering(X0)
| reflexive(X0) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f9,plain,
! [X0] :
( ~ relation(X0)
| ~ well_ordering(X0)
| transitive(X0) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f10,plain,
! [X0] :
( ~ relation(X0)
| ~ well_ordering(X0)
| antisymmetric(X0) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f11,plain,
! [X0] :
( ~ relation(X0)
| ~ well_ordering(X0)
| connected(X0) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f12,plain,
! [X0] :
( ~ relation(X0)
| ~ well_ordering(X0)
| well_founded_relation(X0) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f13,plain,
! [X0] :
( ~ relation(X0)
| well_ordering(X0)
| ~ reflexive(X0)
| ~ transitive(X0)
| ~ antisymmetric(X0)
| ~ connected(X0)
| ~ well_founded_relation(X0) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f17,plain,
! [A] :
( ~ relation(A)
| ! [B] :
( ~ relation(B)
| ! [C] :
( ~ relation(C)
| ~ function(C)
| ~ relation_isomorphism(A,B,C)
| ( ( ~ reflexive(A)
| reflexive(B) )
& ( ~ transitive(A)
| transitive(B) )
& ( ~ connected(A)
| connected(B) )
& ( ~ antisymmetric(A)
| antisymmetric(B) )
& ( ~ well_founded_relation(A)
| well_founded_relation(B) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f3]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ~ relation(X0)
| ~ relation(X1)
| ~ relation(X2)
| ~ function(X2)
| ~ relation_isomorphism(X0,X1,X2)
| ~ reflexive(X0)
| reflexive(X1) ),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ~ relation(X0)
| ~ relation(X1)
| ~ relation(X2)
| ~ function(X2)
| ~ relation_isomorphism(X0,X1,X2)
| ~ transitive(X0)
| transitive(X1) ),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ~ relation(X0)
| ~ relation(X1)
| ~ relation(X2)
| ~ function(X2)
| ~ relation_isomorphism(X0,X1,X2)
| ~ connected(X0)
| connected(X1) ),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ~ relation(X0)
| ~ relation(X1)
| ~ relation(X2)
| ~ function(X2)
| ~ relation_isomorphism(X0,X1,X2)
| ~ antisymmetric(X0)
| antisymmetric(X1) ),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ~ relation(X0)
| ~ relation(X1)
| ~ relation(X2)
| ~ function(X2)
| ~ relation_isomorphism(X0,X1,X2)
| ~ well_founded_relation(X0)
| well_founded_relation(X1) ),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f23,plain,
? [A] :
( relation(A)
& ? [B] :
( relation(B)
& ? [C] :
( relation(C)
& function(C)
& well_ordering(A)
& relation_isomorphism(A,B,C)
& ~ well_ordering(B) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f5]) ).
fof(f24,plain,
( relation(sk0_1)
& relation(sk0_2)
& relation(sk0_3)
& function(sk0_3)
& well_ordering(sk0_1)
& relation_isomorphism(sk0_1,sk0_2,sk0_3)
& ~ well_ordering(sk0_2) ),
inference(skolemization,[status(esa)],[f23]) ).
fof(f25,plain,
relation(sk0_1),
inference(cnf_transformation,[status(esa)],[f24]) ).
fof(f26,plain,
relation(sk0_2),
inference(cnf_transformation,[status(esa)],[f24]) ).
fof(f27,plain,
relation(sk0_3),
inference(cnf_transformation,[status(esa)],[f24]) ).
fof(f28,plain,
function(sk0_3),
inference(cnf_transformation,[status(esa)],[f24]) ).
fof(f29,plain,
well_ordering(sk0_1),
inference(cnf_transformation,[status(esa)],[f24]) ).
fof(f30,plain,
relation_isomorphism(sk0_1,sk0_2,sk0_3),
inference(cnf_transformation,[status(esa)],[f24]) ).
fof(f31,plain,
~ well_ordering(sk0_2),
inference(cnf_transformation,[status(esa)],[f24]) ).
fof(f32,plain,
( spl0_0
<=> relation(sk0_1) ),
introduced(split_symbol_definition) ).
fof(f34,plain,
( ~ relation(sk0_1)
| spl0_0 ),
inference(component_clause,[status(thm)],[f32]) ).
fof(f35,plain,
( spl0_1
<=> reflexive(sk0_1) ),
introduced(split_symbol_definition) ).
fof(f38,plain,
( ~ relation(sk0_1)
| reflexive(sk0_1) ),
inference(resolution,[status(thm)],[f8,f29]) ).
fof(f39,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f38,f32,f35]) ).
fof(f40,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f34,f25]) ).
fof(f41,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f40]) ).
fof(f42,plain,
( spl0_2
<=> transitive(sk0_1) ),
introduced(split_symbol_definition) ).
fof(f45,plain,
( ~ relation(sk0_1)
| transitive(sk0_1) ),
inference(resolution,[status(thm)],[f9,f29]) ).
fof(f46,plain,
( ~ spl0_0
| spl0_2 ),
inference(split_clause,[status(thm)],[f45,f32,f42]) ).
fof(f47,plain,
( spl0_3
<=> antisymmetric(sk0_1) ),
introduced(split_symbol_definition) ).
fof(f50,plain,
( ~ relation(sk0_1)
| antisymmetric(sk0_1) ),
inference(resolution,[status(thm)],[f10,f29]) ).
fof(f51,plain,
( ~ spl0_0
| spl0_3 ),
inference(split_clause,[status(thm)],[f50,f32,f47]) ).
fof(f52,plain,
( spl0_4
<=> connected(sk0_1) ),
introduced(split_symbol_definition) ).
fof(f55,plain,
( ~ relation(sk0_1)
| connected(sk0_1) ),
inference(resolution,[status(thm)],[f11,f29]) ).
fof(f56,plain,
( ~ spl0_0
| spl0_4 ),
inference(split_clause,[status(thm)],[f55,f32,f52]) ).
fof(f57,plain,
( spl0_5
<=> well_founded_relation(sk0_1) ),
introduced(split_symbol_definition) ).
fof(f60,plain,
( ~ relation(sk0_1)
| well_founded_relation(sk0_1) ),
inference(resolution,[status(thm)],[f12,f29]) ).
fof(f61,plain,
( ~ spl0_0
| spl0_5 ),
inference(split_clause,[status(thm)],[f60,f32,f57]) ).
fof(f62,plain,
( spl0_6
<=> relation(sk0_2) ),
introduced(split_symbol_definition) ).
fof(f64,plain,
( ~ relation(sk0_2)
| spl0_6 ),
inference(component_clause,[status(thm)],[f62]) ).
fof(f65,plain,
( spl0_7
<=> relation(sk0_3) ),
introduced(split_symbol_definition) ).
fof(f67,plain,
( ~ relation(sk0_3)
| spl0_7 ),
inference(component_clause,[status(thm)],[f65]) ).
fof(f68,plain,
( spl0_8
<=> function(sk0_3) ),
introduced(split_symbol_definition) ).
fof(f70,plain,
( ~ function(sk0_3)
| spl0_8 ),
inference(component_clause,[status(thm)],[f68]) ).
fof(f71,plain,
( spl0_9
<=> reflexive(sk0_2) ),
introduced(split_symbol_definition) ).
fof(f72,plain,
( reflexive(sk0_2)
| ~ spl0_9 ),
inference(component_clause,[status(thm)],[f71]) ).
fof(f74,plain,
( ~ relation(sk0_1)
| ~ relation(sk0_2)
| ~ relation(sk0_3)
| ~ function(sk0_3)
| ~ reflexive(sk0_1)
| reflexive(sk0_2) ),
inference(resolution,[status(thm)],[f18,f30]) ).
fof(f75,plain,
( ~ spl0_0
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_1
| spl0_9 ),
inference(split_clause,[status(thm)],[f74,f32,f62,f65,f68,f35,f71]) ).
fof(f76,plain,
( $false
| spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f70,f28]) ).
fof(f77,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f76]) ).
fof(f78,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f67,f27]) ).
fof(f79,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f78]) ).
fof(f80,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f64,f26]) ).
fof(f81,plain,
spl0_6,
inference(contradiction_clause,[status(thm)],[f80]) ).
fof(f82,plain,
( spl0_10
<=> transitive(sk0_2) ),
introduced(split_symbol_definition) ).
fof(f85,plain,
( ~ relation(sk0_1)
| ~ relation(sk0_2)
| ~ relation(sk0_3)
| ~ function(sk0_3)
| ~ transitive(sk0_1)
| transitive(sk0_2) ),
inference(resolution,[status(thm)],[f19,f30]) ).
fof(f86,plain,
( ~ spl0_0
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_2
| spl0_10 ),
inference(split_clause,[status(thm)],[f85,f32,f62,f65,f68,f42,f82]) ).
fof(f87,plain,
( spl0_11
<=> connected(sk0_2) ),
introduced(split_symbol_definition) ).
fof(f90,plain,
( ~ relation(sk0_1)
| ~ relation(sk0_2)
| ~ relation(sk0_3)
| ~ function(sk0_3)
| ~ connected(sk0_1)
| connected(sk0_2) ),
inference(resolution,[status(thm)],[f20,f30]) ).
fof(f91,plain,
( ~ spl0_0
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_4
| spl0_11 ),
inference(split_clause,[status(thm)],[f90,f32,f62,f65,f68,f52,f87]) ).
fof(f92,plain,
( spl0_12
<=> antisymmetric(sk0_2) ),
introduced(split_symbol_definition) ).
fof(f95,plain,
( ~ relation(sk0_1)
| ~ relation(sk0_2)
| ~ relation(sk0_3)
| ~ function(sk0_3)
| ~ antisymmetric(sk0_1)
| antisymmetric(sk0_2) ),
inference(resolution,[status(thm)],[f21,f30]) ).
fof(f96,plain,
( ~ spl0_0
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_3
| spl0_12 ),
inference(split_clause,[status(thm)],[f95,f32,f62,f65,f68,f47,f92]) ).
fof(f97,plain,
( spl0_13
<=> well_founded_relation(sk0_2) ),
introduced(split_symbol_definition) ).
fof(f100,plain,
( ~ relation(sk0_1)
| ~ relation(sk0_2)
| ~ relation(sk0_3)
| ~ function(sk0_3)
| ~ well_founded_relation(sk0_1)
| well_founded_relation(sk0_2) ),
inference(resolution,[status(thm)],[f22,f30]) ).
fof(f101,plain,
( ~ spl0_0
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_5
| spl0_13 ),
inference(split_clause,[status(thm)],[f100,f32,f62,f65,f68,f57,f97]) ).
fof(f115,plain,
( spl0_15
<=> well_ordering(sk0_2) ),
introduced(split_symbol_definition) ).
fof(f116,plain,
( well_ordering(sk0_2)
| ~ spl0_15 ),
inference(component_clause,[status(thm)],[f115]) ).
fof(f118,plain,
( ~ relation(sk0_2)
| well_ordering(sk0_2)
| ~ transitive(sk0_2)
| ~ antisymmetric(sk0_2)
| ~ connected(sk0_2)
| ~ well_founded_relation(sk0_2)
| ~ spl0_9 ),
inference(resolution,[status(thm)],[f72,f13]) ).
fof(f119,plain,
( ~ spl0_6
| spl0_15
| ~ spl0_10
| ~ spl0_12
| ~ spl0_11
| ~ spl0_13
| ~ spl0_9 ),
inference(split_clause,[status(thm)],[f118,f62,f115,f82,f92,f87,f97,f71]) ).
fof(f120,plain,
( $false
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[status(thm)],[f116,f31]) ).
fof(f121,plain,
~ spl0_15,
inference(contradiction_clause,[status(thm)],[f120]) ).
fof(f122,plain,
$false,
inference(sat_refutation,[status(thm)],[f39,f41,f46,f51,f56,f61,f75,f77,f79,f81,f86,f91,f96,f101,f119,f121]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU261+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Apr 29 20:01:40 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % Drodi V3.6.0
% 0.14/0.35 % Refutation found
% 0.14/0.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.36 % Elapsed time: 0.017431 seconds
% 0.14/0.36 % CPU time: 0.026237 seconds
% 0.14/0.36 % Total memory used: 6.621 MB
% 0.14/0.36 % Net memory used: 6.584 MB
%------------------------------------------------------------------------------