%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU047+1 : 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 : n001.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:55:07 PM UTC 2026
% Result : Theorem 0.40s 1.19s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 16 unt; 4 def)
% Number of atoms : 103 ( 39 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 80 ( 34 ~; 25 |; 13 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 38 !; 6 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f31,conjecture,
! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( subset(X0,X1)
=> ( relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) = relation_rng_restriction(X0,X2)
& relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) = relation_rng_restriction(X0,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t97_funct_1) ).
fof(f32,negated_conjecture,
~ ! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( subset(X0,X1)
=> ( relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) = relation_rng_restriction(X0,X2)
& relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) = relation_rng_restriction(X0,X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f31]) ).
fof(f33,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( subset(X0,X1)
=> relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) = relation_rng_restriction(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t129_relat_1) ).
fof(f34,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( subset(X0,X1)
=> relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) = relation_rng_restriction(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t130_relat_1) ).
fof(f58,plain,
? [X0,X1,X2] :
( function(X2)
& relation(X2)
& subset(X0,X1)
& ( relation_rng_restriction(X0,X2) != relation_rng_restriction(X0,relation_rng_restriction(X1,X2))
| relation_rng_restriction(X0,X2) != relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) ) ),
inference(ennf_transformation,[],[f32]) ).
fof(f59,plain,
? [X0,X1,X2] :
( function(X2)
& relation(X2)
& subset(X0,X1)
& ( relation_rng_restriction(X0,X2) != relation_rng_restriction(X0,relation_rng_restriction(X1,X2))
| relation_rng_restriction(X0,X2) != relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) ) ),
inference(flattening,[],[f58]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ~ relation(X2)
| ~ subset(X0,X1)
| relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) = relation_rng_restriction(X0,X2) ),
inference(ennf_transformation,[],[f33]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ~ relation(X2)
| ~ subset(X0,X1)
| relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) = relation_rng_restriction(X0,X2) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ~ relation(X2)
| ~ subset(X0,X1)
| relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) = relation_rng_restriction(X0,X2) ),
inference(ennf_transformation,[],[f34]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ~ relation(X2)
| ~ subset(X0,X1)
| relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) = relation_rng_restriction(X0,X2) ),
inference(flattening,[],[f62]) ).
fof(f76,plain,
( function(sK13)
& relation(sK13)
& subset(sK11,sK12)
& ( relation_rng_restriction(sK11,sK13) != relation_rng_restriction(sK11,relation_rng_restriction(sK12,sK13))
| relation_rng_restriction(sK11,sK13) != relation_rng_restriction(sK12,relation_rng_restriction(sK11,sK13)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12,sK13]),skolemize(X0,sK11),skolemize(X1,sK12),skolemize(X2,sK13)],[f59]) ).
fof(f121,plain,
relation(sK13),
inference(cnf_transformation,[],[f76]) ).
fof(f122,plain,
subset(sK11,sK12),
inference(cnf_transformation,[],[f76]) ).
fof(f123,plain,
( relation_rng_restriction(sK11,sK13) != relation_rng_restriction(sK11,relation_rng_restriction(sK12,sK13))
| relation_rng_restriction(sK11,sK13) != relation_rng_restriction(sK12,relation_rng_restriction(sK11,sK13)) ),
inference(cnf_transformation,[],[f76]) ).
fof(f124,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ subset(X0,X1)
| relation_rng_restriction(X0,X2) = relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) ),
inference(cnf_transformation,[],[f61]) ).
fof(f125,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ subset(X0,X1)
| relation_rng_restriction(X0,X2) = relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) ),
inference(cnf_transformation,[],[f63]) ).
tcf(c_90,negated_conjecture,
( ( relation_rng_restriction(sK12,relation_rng_restriction(sK11,sK13)) != relation_rng_restriction(sK11,sK13) )
| ( relation_rng_restriction(sK11,relation_rng_restriction(sK12,sK13)) != relation_rng_restriction(sK11,sK13) ) ),
inference(cnf_transformation,[],[f123]) ).
tcf(c_91,negated_conjecture,
subset(sK11,sK12),
inference(cnf_transformation,[],[f122]) ).
tcf(c_92,negated_conjecture,
relation(sK13),
inference(cnf_transformation,[],[f121]) ).
tcf(c_94,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( relation_rng_restriction(X1,relation_rng_restriction(X0,X2)) = relation_rng_restriction(X0,X2) )
| ~ relation(X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f124]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( relation_rng_restriction(X0,relation_rng_restriction(X1,X2)) = relation_rng_restriction(X0,X2) )
| ~ relation(X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
tcf(c_1268,definition,
iPr_def_10 = relation_rng_restriction(sK12,sK13),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1269,definition,
iPr_def_11 = relation_rng_restriction(sK11,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1270,definition,
iPr_def_12 = relation_rng_restriction(sK11,sK13),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_1271,definition,
iPr_def_13 = relation_rng_restriction(sK12,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_1272,negated_conjecture,
relation(sK13),
inference(demodulation,[status(thm)],[c_92]) ).
tcf(c_1273,negated_conjecture,
subset(sK11,sK12),
inference(demodulation,[status(thm)],[c_91]) ).
tcf(c_1274,negated_conjecture,
( ( iPr_def_13 != iPr_def_12 )
| ( iPr_def_11 != iPr_def_12 ) ),
inference(demodulation,[status(thm)],[c_90,c_1271,c_1270,c_1268,c_1269]) ).
tcf(c_2009,plain,
! [X0: $i] :
( ( relation_rng_restriction(sK12,relation_rng_restriction(sK11,X0)) = relation_rng_restriction(sK11,X0) )
| ~ relation(X0) ),
inference(superposition,[status(thm)],[c_1273,c_94]) ).
tcf(c_2032,plain,
! [X0: $i] :
( ( relation_rng_restriction(sK11,relation_rng_restriction(sK12,X0)) = relation_rng_restriction(sK11,X0) )
| ~ relation(X0) ),
inference(superposition,[status(thm)],[c_1273,c_95]) ).
tcf(c_2120,plain,
relation_rng_restriction(sK12,relation_rng_restriction(sK11,sK13)) = relation_rng_restriction(sK11,sK13),
inference(superposition,[status(thm)],[c_1272,c_2009]) ).
tcf(c_2126,plain,
iPr_def_12 = iPr_def_13,
inference(light_normalisation,[status(thm)],[c_2120,c_1270,c_1271]) ).
tcf(c_2131,plain,
( ( iPr_def_12 != iPr_def_12 )
| ( iPr_def_11 != iPr_def_12 ) ),
inference(demodulation,[status(thm)],[c_1274,c_2126]) ).
tcf(c_2132,plain,
iPr_def_11 != iPr_def_12,
inference(equality_resolution_simp,[status(thm)],[c_2131]) ).
tcf(c_2147,plain,
relation_rng_restriction(sK11,relation_rng_restriction(sK12,sK13)) = relation_rng_restriction(sK11,sK13),
inference(superposition,[status(thm)],[c_1272,c_2032]) ).
tcf(c_2154,plain,
iPr_def_11 = iPr_def_12,
inference(light_normalisation,[status(thm)],[c_2147,c_1268,c_1269,c_1270]) ).
tcf(c_2159,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2154,c_2132]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU047+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 12:44:07 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 0.40/1.19 % SZS status Started for theBenchmark.p
% 0.40/1.19 % SZS status Theorem for theBenchmark.p
% 0.40/1.19
% 0.40/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.40/1.19
% 0.40/1.19 % ------ iProver source info
% 0.40/1.19
% 0.40/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 0.40/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.40/1.19 % git: non_committed_changes: false
% 0.40/1.19
% 0.40/1.19 % ------ Parsing...
% 0.40/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.40/1.19
% 0.40/1.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 8 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 0.40/1.19
% 0.40/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.40/1.19
% 0.40/1.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.40/1.19 % ------ Proving...
% 0.40/1.19 % ------ Problem Properties
% 0.40/1.19
% 0.40/1.19 %
% 0.40/1.19 % clauses 41
% 0.40/1.19 % conjectures 3
% 0.40/1.19 % EPR 26
% 0.40/1.19 % Horn 39
% 0.40/1.19 % unary 24
% 0.40/1.19 % binary 11
% 0.40/1.19 % lits 64
% 0.40/1.19 % lits eq 10
% 0.40/1.19 % fd_pure 0
% 0.40/1.19 % fd_pseudo 0
% 0.40/1.19 % fd_cond 1
% 0.40/1.19 % fd_pseudo_cond 1
% 0.40/1.19 % AC symbols 0
% 0.40/1.19
% 0.40/1.19 % ------ Schedule dynamic 5 is on
% 0.40/1.19
% 0.40/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.40/1.19
% 0.40/1.19
% 0.40/1.19 % ------
% 0.40/1.19 % Current options:
% 0.40/1.19 % ------
% 0.40/1.19
% 0.40/1.19
% 0.40/1.19 %
% 0.40/1.19
% 0.40/1.19 % ------ Proving...
% 0.40/1.19 %
% 0.40/1.19
% 0.40/1.19 % SZS status Theorem for theBenchmark.p
% 0.40/1.19
% 0.40/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.40/1.19
% 0.40/1.19
%------------------------------------------------------------------------------