%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU247+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n005.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:21 PM UTC 2026
% Result : Theorem 0.77s 1.29s
% Output : CNFRefutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 32 ( 17 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 24 ( 12 ~; 6 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 27 !; 2 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f191,axiom,
! [X0,X1,X2] :
( relation(X2)
=> relation_dom_restriction(relation_rng_restriction(X0,X2),X1) = relation_rng_restriction(X0,relation_dom_restriction(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t140_relat_1) ).
fof(f205,axiom,
! [X0,X1] :
( relation(X1)
=> relation_restriction(X1,X0) = relation_dom_restriction(relation_rng_restriction(X0,X1),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_wellord1) ).
fof(f207,conjecture,
! [X0,X1] :
( relation(X1)
=> relation_restriction(X1,X0) = relation_rng_restriction(X0,relation_dom_restriction(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_wellord1) ).
fof(f208,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> relation_restriction(X1,X0) = relation_rng_restriction(X0,relation_dom_restriction(X1,X0)) ),
inference(negated_conjecture,[status(cth)],[f207]) ).
fof(f469,plain,
! [X0,X1,X2] :
( ~ relation(X2)
| relation_dom_restriction(relation_rng_restriction(X0,X2),X1) = relation_rng_restriction(X0,relation_dom_restriction(X2,X1)) ),
inference(ennf_transformation,[],[f191]) ).
fof(f488,plain,
! [X0,X1] :
( ~ relation(X1)
| relation_restriction(X1,X0) = relation_dom_restriction(relation_rng_restriction(X0,X1),X0) ),
inference(ennf_transformation,[],[f205]) ).
fof(f489,plain,
? [X0,X1] :
( relation(X1)
& relation_restriction(X1,X0) != relation_rng_restriction(X0,relation_dom_restriction(X1,X0)) ),
inference(ennf_transformation,[],[f208]) ).
fof(f791,plain,
( relation(sK105)
& relation_restriction(sK105,sK104) != relation_rng_restriction(sK104,relation_dom_restriction(sK105,sK104)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK104,sK105]),skolemize(X0,sK104),skolemize(X1,sK105)],[f489]) ).
fof(f1281,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| relation_dom_restriction(relation_rng_restriction(X0,X2),X1) = relation_rng_restriction(X0,relation_dom_restriction(X2,X1)) ),
inference(cnf_transformation,[],[f469]) ).
fof(f1303,plain,
! [X0,X1] :
( ~ relation(X1)
| relation_restriction(X1,X0) = relation_dom_restriction(relation_rng_restriction(X0,X1),X0) ),
inference(cnf_transformation,[],[f488]) ).
fof(f1305,plain,
relation(sK105),
inference(cnf_transformation,[],[f791]) ).
fof(f1306,plain,
relation_restriction(sK105,sK104) != relation_rng_restriction(sK104,relation_dom_restriction(sK105,sK104)),
inference(cnf_transformation,[],[f791]) ).
tcf(c_484,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( relation_dom_restriction(relation_rng_restriction(X1,X0),X2) = relation_rng_restriction(X1,relation_dom_restriction(X0,X2)) )
| ~ relation(X0) ),
inference(cnf_transformation,[],[f1281]) ).
tcf(c_506,plain,
! [X0: $i,X1: $i] :
( ( relation_dom_restriction(relation_rng_restriction(X1,X0),X1) = relation_restriction(X0,X1) )
| ~ relation(X0) ),
inference(cnf_transformation,[],[f1303]) ).
tcf(c_508,negated_conjecture,
relation_rng_restriction(sK104,relation_dom_restriction(sK105,sK104)) != relation_restriction(sK105,sK104),
inference(cnf_transformation,[],[f1306]) ).
tcf(c_509,negated_conjecture,
relation(sK105),
inference(cnf_transformation,[],[f1305]) ).
tcf(c_829,plain,
! [X0: $i] : relation_dom_restriction(relation_rng_restriction(X0,sK105),X0) = relation_restriction(sK105,X0),
inference(superposition,[status(thm)],[c_509,c_506]) ).
tcf(c_865,plain,
! [X0: $i,X1: $i] : relation_dom_restriction(relation_rng_restriction(X0,sK105),X1) = relation_rng_restriction(X0,relation_dom_restriction(sK105,X1)),
inference(superposition,[status(thm)],[c_509,c_484]) ).
tcf(c_866,plain,
relation_dom_restriction(relation_rng_restriction(sK104,sK105),sK104) != relation_restriction(sK105,sK104),
inference(demodulation,[status(thm)],[c_508,c_865]) ).
tcf(c_1218,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_866,c_829]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU247+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.37 % Computer : n005.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Thu Sep 24 13:23:17 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/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.12/0.42
% 0.12/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42
% 0.12/0.42 % Detected problem language: tptp
% 0.12/0.43 % Proving...
% 0.77/1.29 % SZS status Started for theBenchmark.p
% 0.77/1.29 % SZS status Theorem for theBenchmark.p
% 0.77/1.29
% 0.77/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.77/1.29
% 0.77/1.29 % ------ iProver source info
% 0.77/1.29
% 0.77/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.77/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.77/1.29 % git: non_committed_changes: false
% 0.77/1.29
% 0.77/1.29 % ------ Parsing...
% 0.77/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.77/1.29 % ------ Proving...
% 0.77/1.29 % ------ Problem Properties
% 0.77/1.29
% 0.77/1.29 %
% 0.77/1.29 % clauses 622
% 0.77/1.29 % conjectures 2
% 0.77/1.29 % EPR 108
% 0.77/1.29 % Horn 495
% 0.77/1.29 % unary 104
% 0.77/1.29 % binary 149
% 0.77/1.29 % lits 1819
% 0.77/1.29 % lits eq 273
% 0.77/1.29 % fd_pure 0
% 0.77/1.29 % fd_pseudo 0
% 0.77/1.29 % fd_cond 21
% 0.77/1.29 % fd_pseudo_cond 98
% 0.77/1.29 % AC symbols 0
% 0.77/1.29
% 0.77/1.29 % ------ Input Options Time Limit: Unbounded
% 0.77/1.29
% 0.77/1.29
% 0.77/1.29 % ------
% 0.77/1.29 % Current options:
% 0.77/1.29 % ------
% 0.77/1.29
% 0.77/1.29
% 0.77/1.29 %
% 0.77/1.29
% 0.77/1.29 % ------ Proving...
% 0.77/1.29 %
% 0.77/1.29
% 0.77/1.29 % SZS status Theorem for theBenchmark.p
% 0.77/1.29
% 0.77/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.77/1.29
% 0.77/1.29
%------------------------------------------------------------------------------