TSTP Solution File: SEU219+3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SEU219+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n003.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:19 EDT 2023
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 8 unt; 0 def)
% Number of atoms : 98 ( 30 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 90 ( 33 ~; 32 |; 13 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 10 (; 9 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [A] :
( ( relation(A)
& function(A) )
=> ( one_to_one(A)
=> function_inverse(A) = relation_inverse(A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f33,axiom,
! [A] :
( relation(A)
=> ( relation_rng(A) = relation_dom(relation_inverse(A))
& relation_dom(A) = relation_rng(relation_inverse(A)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f36,conjecture,
! [A] :
( ( relation(A)
& function(A) )
=> ( one_to_one(A)
=> ( relation_rng(A) = relation_dom(function_inverse(A))
& relation_dom(A) = relation_rng(function_inverse(A)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f37,negated_conjecture,
~ ! [A] :
( ( relation(A)
& function(A) )
=> ( one_to_one(A)
=> ( relation_rng(A) = relation_dom(function_inverse(A))
& relation_dom(A) = relation_rng(function_inverse(A)) ) ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
fof(f52,plain,
! [A] :
( ~ relation(A)
| ~ function(A)
| ~ one_to_one(A)
| function_inverse(A) = relation_inverse(A) ),
inference(pre_NNF_transformation,[status(esa)],[f5]) ).
fof(f53,plain,
! [X0] :
( ~ relation(X0)
| ~ function(X0)
| ~ one_to_one(X0)
| function_inverse(X0) = relation_inverse(X0) ),
inference(cnf_transformation,[status(esa)],[f52]) ).
fof(f123,plain,
! [A] :
( ~ relation(A)
| ( relation_rng(A) = relation_dom(relation_inverse(A))
& relation_dom(A) = relation_rng(relation_inverse(A)) ) ),
inference(pre_NNF_transformation,[status(esa)],[f33]) ).
fof(f124,plain,
! [X0] :
( ~ relation(X0)
| relation_rng(X0) = relation_dom(relation_inverse(X0)) ),
inference(cnf_transformation,[status(esa)],[f123]) ).
fof(f125,plain,
! [X0] :
( ~ relation(X0)
| relation_dom(X0) = relation_rng(relation_inverse(X0)) ),
inference(cnf_transformation,[status(esa)],[f123]) ).
fof(f133,plain,
? [A] :
( relation(A)
& function(A)
& one_to_one(A)
& ( relation_rng(A) != relation_dom(function_inverse(A))
| relation_dom(A) != relation_rng(function_inverse(A)) ) ),
inference(pre_NNF_transformation,[status(esa)],[f37]) ).
fof(f134,plain,
( relation(sk0_11)
& function(sk0_11)
& one_to_one(sk0_11)
& ( relation_rng(sk0_11) != relation_dom(function_inverse(sk0_11))
| relation_dom(sk0_11) != relation_rng(function_inverse(sk0_11)) ) ),
inference(skolemization,[status(esa)],[f133]) ).
fof(f135,plain,
relation(sk0_11),
inference(cnf_transformation,[status(esa)],[f134]) ).
fof(f136,plain,
function(sk0_11),
inference(cnf_transformation,[status(esa)],[f134]) ).
fof(f137,plain,
one_to_one(sk0_11),
inference(cnf_transformation,[status(esa)],[f134]) ).
fof(f138,plain,
( relation_rng(sk0_11) != relation_dom(function_inverse(sk0_11))
| relation_dom(sk0_11) != relation_rng(function_inverse(sk0_11)) ),
inference(cnf_transformation,[status(esa)],[f134]) ).
fof(f150,plain,
( spl0_0
<=> relation_rng(sk0_11) = relation_dom(function_inverse(sk0_11)) ),
introduced(split_symbol_definition) ).
fof(f152,plain,
( relation_rng(sk0_11) != relation_dom(function_inverse(sk0_11))
| spl0_0 ),
inference(component_clause,[status(thm)],[f150]) ).
fof(f153,plain,
( spl0_1
<=> relation_dom(sk0_11) = relation_rng(function_inverse(sk0_11)) ),
introduced(split_symbol_definition) ).
fof(f155,plain,
( relation_dom(sk0_11) != relation_rng(function_inverse(sk0_11))
| spl0_1 ),
inference(component_clause,[status(thm)],[f153]) ).
fof(f156,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f138,f150,f153]) ).
fof(f161,plain,
relation_rng(sk0_11) = relation_dom(relation_inverse(sk0_11)),
inference(resolution,[status(thm)],[f124,f135]) ).
fof(f181,plain,
( spl0_6
<=> relation(sk0_11) ),
introduced(split_symbol_definition) ).
fof(f183,plain,
( ~ relation(sk0_11)
| spl0_6 ),
inference(component_clause,[status(thm)],[f181]) ).
fof(f184,plain,
( spl0_7
<=> function(sk0_11) ),
introduced(split_symbol_definition) ).
fof(f186,plain,
( ~ function(sk0_11)
| spl0_7 ),
inference(component_clause,[status(thm)],[f184]) ).
fof(f187,plain,
( spl0_8
<=> function_inverse(sk0_11) = relation_inverse(sk0_11) ),
introduced(split_symbol_definition) ).
fof(f188,plain,
( function_inverse(sk0_11) = relation_inverse(sk0_11)
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f187]) ).
fof(f190,plain,
( ~ relation(sk0_11)
| ~ function(sk0_11)
| function_inverse(sk0_11) = relation_inverse(sk0_11) ),
inference(resolution,[status(thm)],[f53,f137]) ).
fof(f191,plain,
( ~ spl0_6
| ~ spl0_7
| spl0_8 ),
inference(split_clause,[status(thm)],[f190,f181,f184,f187]) ).
fof(f195,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f186,f136]) ).
fof(f196,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f195]) ).
fof(f197,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f183,f135]) ).
fof(f198,plain,
spl0_6,
inference(contradiction_clause,[status(thm)],[f197]) ).
fof(f217,plain,
( relation_rng(sk0_11) = relation_dom(function_inverse(sk0_11))
| ~ spl0_8 ),
inference(backward_demodulation,[status(thm)],[f188,f161]) ).
fof(f218,plain,
( $false
| spl0_0
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f217,f152]) ).
fof(f219,plain,
( spl0_0
| ~ spl0_8 ),
inference(contradiction_clause,[status(thm)],[f218]) ).
fof(f458,plain,
relation_dom(sk0_11) = relation_rng(relation_inverse(sk0_11)),
inference(resolution,[status(thm)],[f125,f135]) ).
fof(f459,plain,
( relation_dom(sk0_11) = relation_rng(function_inverse(sk0_11))
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f188,f458]) ).
fof(f460,plain,
( $false
| spl0_1
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f459,f155]) ).
fof(f461,plain,
( spl0_1
| ~ spl0_8 ),
inference(contradiction_clause,[status(thm)],[f460]) ).
fof(f462,plain,
$false,
inference(sat_refutation,[status(thm)],[f156,f191,f196,f198,f219,f461]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU219+3 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 09:16:53 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.37 % Elapsed time: 0.025937 seconds
% 0.13/0.37 % CPU time: 0.044059 seconds
% 0.13/0.37 % Memory used: 12.068 MB
%------------------------------------------------------------------------------