%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU219+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:56:10 PM UTC 2026
% Result : Theorem 1.65s 1.28s
% Output : CNFRefutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 8 unt; 0 def)
% Number of atoms : 88 ( 36 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 96 ( 40 ~; 33 |; 16 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 16 ( 0 sgn 14 !; 2 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ( one_to_one(X0)
=> function_inverse(X0) = relation_inverse(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_funct_1) ).
fof(f33,axiom,
! [X0] :
( relation(X0)
=> ( relation_dom(X0) = relation_rng(relation_inverse(X0))
& relation_rng(X0) = relation_dom(relation_inverse(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_relat_1) ).
fof(f36,conjecture,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ( one_to_one(X0)
=> ( relation_dom(X0) = relation_rng(function_inverse(X0))
& relation_rng(X0) = relation_dom(function_inverse(X0)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t55_funct_1) ).
fof(f37,negated_conjecture,
~ ! [X0] :
( ( function(X0)
& relation(X0) )
=> ( one_to_one(X0)
=> ( relation_dom(X0) = relation_rng(function_inverse(X0))
& relation_rng(X0) = relation_dom(function_inverse(X0)) ) ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
fof(f51,plain,
! [X0] :
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| function_inverse(X0) = relation_inverse(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f52,plain,
! [X0] :
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| function_inverse(X0) = relation_inverse(X0) ),
inference(flattening,[],[f51]) ).
fof(f70,plain,
! [X0] :
( ~ relation(X0)
| ( relation_dom(X0) = relation_rng(relation_inverse(X0))
& relation_rng(X0) = relation_dom(relation_inverse(X0)) ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f74,plain,
? [X0] :
( function(X0)
& relation(X0)
& one_to_one(X0)
& ( relation_dom(X0) != relation_rng(function_inverse(X0))
| relation_rng(X0) != relation_dom(function_inverse(X0)) ) ),
inference(ennf_transformation,[],[f37]) ).
fof(f75,plain,
? [X0] :
( function(X0)
& relation(X0)
& one_to_one(X0)
& ( relation_dom(X0) != relation_rng(function_inverse(X0))
| relation_rng(X0) != relation_dom(function_inverse(X0)) ) ),
inference(flattening,[],[f74]) ).
fof(f91,plain,
( function(sK11)
& relation(sK11)
& one_to_one(sK11)
& ( relation_dom(sK11) != relation_rng(function_inverse(sK11))
| relation_rng(sK11) != relation_dom(function_inverse(sK11)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X0,sK11)],[f75]) ).
fof(f98,plain,
! [X0] :
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| function_inverse(X0) = relation_inverse(X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f142,plain,
! [X0] :
( ~ relation(X0)
| relation_dom(X0) = relation_rng(relation_inverse(X0)) ),
inference(cnf_transformation,[],[f70]) ).
fof(f143,plain,
! [X0] :
( ~ relation(X0)
| relation_rng(X0) = relation_dom(relation_inverse(X0)) ),
inference(cnf_transformation,[],[f70]) ).
fof(f146,plain,
function(sK11),
inference(cnf_transformation,[],[f91]) ).
fof(f147,plain,
relation(sK11),
inference(cnf_transformation,[],[f91]) ).
fof(f148,plain,
one_to_one(sK11),
inference(cnf_transformation,[],[f91]) ).
fof(f149,plain,
( relation_dom(sK11) != relation_rng(function_inverse(sK11))
| relation_rng(sK11) != relation_dom(function_inverse(sK11)) ),
inference(cnf_transformation,[],[f91]) ).
tcf(c_53,plain,
! [X0: $i] :
( ( function_inverse(X0) = relation_inverse(X0) )
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f98]) ).
tcf(c_97,plain,
! [X0: $i] :
( ( relation_dom(relation_inverse(X0)) = relation_rng(X0) )
| ~ relation(X0) ),
inference(cnf_transformation,[],[f143]) ).
tcf(c_98,plain,
! [X0: $i] :
( ( relation_rng(relation_inverse(X0)) = relation_dom(X0) )
| ~ relation(X0) ),
inference(cnf_transformation,[],[f142]) ).
tcf(c_101,negated_conjecture,
( ( relation_rng(function_inverse(sK11)) != relation_dom(sK11) )
| ( relation_dom(function_inverse(sK11)) != relation_rng(sK11) ) ),
inference(cnf_transformation,[],[f149]) ).
tcf(c_102,negated_conjecture,
one_to_one(sK11),
inference(cnf_transformation,[],[f148]) ).
tcf(c_103,negated_conjecture,
relation(sK11),
inference(cnf_transformation,[],[f147]) ).
tcf(c_104,negated_conjecture,
function(sK11),
inference(cnf_transformation,[],[f146]) ).
tcf(c_135,plain,
( ( relation_rng(relation_inverse(sK11)) = relation_dom(sK11) )
| ~ relation(sK11) ),
inference(instantiation,[status(thm)],[c_98]) ).
tcf(c_136,plain,
( ( relation_dom(relation_inverse(sK11)) = relation_rng(sK11) )
| ~ relation(sK11) ),
inference(instantiation,[status(thm)],[c_97]) ).
tcf(c_139,plain,
( ( function_inverse(sK11) = relation_inverse(sK11) )
| ~ one_to_one(sK11)
| ~ relation(sK11)
| ~ function(sK11) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_552,plain,
! [X0: $i] :
( ( function_inverse(X0) = relation_inverse(X0) )
| ~ relation(X0)
| ~ function(X0)
| ( X0 != sK11 ) ),
inference(resolution_lifted,[status(thm)],[c_53,c_102]) ).
tcf(c_553,plain,
( ( function_inverse(sK11) = relation_inverse(sK11) )
| ~ relation(sK11)
| ~ function(sK11) ),
inference(unflattening,[status(thm)],[c_552]) ).
tcf(c_554,plain,
function_inverse(sK11) = relation_inverse(sK11),
inference(global_subsumption_just,[status(thm)],[c_553,c_104,c_103,c_102,c_139]) ).
tcf(c_879,plain,
( ( relation_rng(relation_inverse(sK11)) != relation_dom(sK11) )
| ( relation_dom(relation_inverse(sK11)) != relation_rng(sK11) ) ),
inference(light_normalisation,[status(thm)],[c_101,c_554]) ).
tcf(c_897,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_879,c_136,c_135,c_103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU219+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n019.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 13:15:04 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 1.65/1.28 % SZS status Started for theBenchmark.p
% 1.65/1.28 % SZS status Theorem for theBenchmark.p
% 1.65/1.28
% 1.65/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.65/1.28
% 1.65/1.28 % ------ iProver source info
% 1.65/1.28
% 1.65/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.65/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.65/1.28 % git: non_committed_changes: false
% 1.65/1.28
% 1.65/1.28 % ------ Parsing...
% 1.65/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.65/1.28
% 1.65/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 1 sf_s rm: 2 0s sf_e pe_s %
% 1.65/1.28
% 1.65/1.28 % SZS status Theorem for theBenchmark.p
% 1.65/1.28
% 1.65/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.65/1.28
% 1.65/1.28
%------------------------------------------------------------------------------