%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU198+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n011.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:51 PM UTC 2026
% Result : Theorem 3.54s 1.68s
% Output : CNFRefutation 3.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 10 unt; 2 def)
% Number of atoms : 98 ( 2 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 91 ( 36 ~; 33 |; 14 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 49 !; 4 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f22,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_rng(relation_rng_restriction(X1,X2)))
<=> ( in(X0,relation_rng(X2))
& in(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t115_relat_1) ).
fof(f23,conjecture,
! [X0,X1] :
( relation(X1)
=> subset(relation_rng(relation_rng_restriction(X0,X1)),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t116_relat_1) ).
fof(f24,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> subset(relation_rng(relation_rng_restriction(X0,X1)),X0) ),
inference(negated_conjecture,[status(cth)],[f23]) ).
fof(f36,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ~ relation(X2)
| ( in(X0,relation_rng(relation_rng_restriction(X1,X2)))
<=> ( in(X0,relation_rng(X2))
& in(X0,X1) ) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f43,plain,
? [X0,X1] :
( relation(X1)
& ~ subset(relation_rng(relation_rng_restriction(X0,X1)),X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f53,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(nnf_transformation,[],[f36]) ).
fof(f54,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(rectify,[],[f53]) ).
fof(f55,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ( in(sK0(X0,X1),X0)
& ~ in(sK0(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f54]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ~ relation(X2)
| ( ( ~ in(X0,relation_rng(relation_rng_restriction(X1,X2)))
| ( in(X0,relation_rng(X2))
& in(X0,X1) ) )
& ( ~ in(X0,relation_rng(X2))
| ~ in(X0,X1)
| in(X0,relation_rng(relation_rng_restriction(X1,X2))) ) ) ),
inference(nnf_transformation,[],[f42]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ~ relation(X2)
| ( ( ~ in(X0,relation_rng(relation_rng_restriction(X1,X2)))
| ( in(X0,relation_rng(X2))
& in(X0,X1) ) )
& ( ~ in(X0,relation_rng(X2))
| ~ in(X0,X1)
| in(X0,relation_rng(relation_rng_restriction(X1,X2))) ) ) ),
inference(flattening,[],[f63]) ).
fof(f65,plain,
( relation(sK9)
& ~ subset(relation_rng(relation_rng_restriction(sK8,sK9)),sK8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X0,sK8),skolemize(X1,sK9)],[f43]) ).
fof(f70,plain,
! [X0,X1] :
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
fof(f71,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
fof(f93,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(X0,relation_rng(relation_rng_restriction(X1,X2)))
| in(X0,X1) ),
inference(cnf_transformation,[],[f64]) ).
fof(f95,plain,
relation(sK9),
inference(cnf_transformation,[],[f65]) ).
fof(f96,plain,
~ subset(relation_rng(relation_rng_restriction(sK8,sK9)),sK8),
inference(cnf_transformation,[],[f65]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f71]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f70]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X1)
| ~ relation(X2)
| ~ in(X0,relation_rng(relation_rng_restriction(X1,X2))) ),
inference(cnf_transformation,[],[f93]) ).
tcf(c_77,negated_conjecture,
~ subset(relation_rng(relation_rng_restriction(sK8,sK9)),sK8),
inference(cnf_transformation,[],[f96]) ).
tcf(c_78,negated_conjecture,
relation(sK9),
inference(cnf_transformation,[],[f95]) ).
tcf(c_1421,definition,
iPr_def_10 = relation_rng_restriction(sK8,sK9),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1422,definition,
iPr_def_11 = relation_rng(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1423,negated_conjecture,
relation(sK9),
inference(demodulation,[status(thm)],[c_78]) ).
tcf(c_1424,negated_conjecture,
~ subset(iPr_def_11,sK8),
inference(demodulation,[status(thm)],[c_77,c_1421,c_1422]) ).
tcf(c_2341,plain,
! [X0: $i] :
( in(X0,sK8)
| ~ relation(sK9)
| ~ in(X0,relation_rng(iPr_def_10)) ),
inference(superposition,[status(thm)],[c_1421,c_75]) ).
tcf(c_2342,plain,
! [X0: $i] :
( in(X0,sK8)
| ~ relation(sK9)
| ~ in(X0,iPr_def_11) ),
inference(light_normalisation,[status(thm)],[c_2341,c_1422]) ).
tcf(c_2343,plain,
! [X0: $i] :
( in(X0,sK8)
| ~ in(X0,iPr_def_11) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2342,c_1423]) ).
tcf(c_2425,plain,
! [X0: $i] :
( subset(iPr_def_11,X0)
| in(sK0(iPr_def_11,X0),sK8) ),
inference(superposition,[status(thm)],[c_52,c_2343]) ).
tcf(c_2495,plain,
subset(iPr_def_11,sK8),
inference(superposition,[status(thm)],[c_2425,c_51]) ).
tcf(c_2496,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2495,c_1424]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU198+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.17/0.62 % Computer : n011.cluster.edu
% 0.17/0.62 % Model : x86_64 x86_64
% 0.17/0.62 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.62 % Memory : 8046.5625MB
% 0.17/0.62 % OS : Linux 6.8.0-71-generic
% 0.17/0.62 % CPULimit : 300
% 0.17/0.62 % WCLimit : 300
% 0.17/0.62 % DateTime : Thu Sep 24 13:08:58 UTC 2026
% 0.17/0.62 % CPUTime :
% 0.17/0.62 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.20/0.68 Running first-order theorem proving
% 0.20/0.68 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.70
% 0.20/0.70 % ======== iProver multi-core TPTP/SMT =========
% 0.20/0.70
% 0.20/0.70 % Detected problem language: tptp
% 0.20/0.71 % Proving...
% 3.54/1.68 % SZS status Started for theBenchmark.p
% 3.54/1.68 % SZS status Theorem for theBenchmark.p
% 3.54/1.68
% 3.54/1.68 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.54/1.68
% 3.54/1.68 % ------ iProver source info
% 3.54/1.68
% 3.54/1.68 % git: date: 2026-07-19 20:42:38 +0200
% 3.54/1.68 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.54/1.68 % git: non_committed_changes: false
% 3.54/1.68
% 3.54/1.68 % ------ Parsing...
% 3.54/1.68 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.54/1.68
% 3.54/1.68 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.54/1.68
% 3.54/1.68 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.54/1.68
% 3.54/1.68 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.54/1.68 % ------ Proving...
% 3.54/1.68 % ------ Problem Properties
% 3.54/1.68
% 3.54/1.68 %
% 3.54/1.68 % clauses 40
% 3.54/1.68 % conjectures 2
% 3.54/1.68 % EPR 21
% 3.54/1.68 % Horn 37
% 3.54/1.68 % unary 17
% 3.54/1.68 % binary 14
% 3.54/1.68 % lits 73
% 3.54/1.68 % lits eq 4
% 3.54/1.68 % fd_pure 0
% 3.54/1.68 % fd_pseudo 0
% 3.54/1.68 % fd_cond 1
% 3.54/1.68 % fd_pseudo_cond 1
% 3.54/1.68 % AC symbols 0
% 3.54/1.68
% 3.54/1.68 % ------ Schedule dynamic 5 is on
% 3.54/1.68
% 3.54/1.68 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.54/1.68
% 3.54/1.68
% 3.54/1.68 % ------
% 3.54/1.68 % Current options:
% 3.54/1.68 % ------
% 3.54/1.68
% 3.54/1.68
% 3.54/1.68 %
% 3.54/1.68
% 3.54/1.68 % ------ Proving...
% 3.54/1.68 %
% 3.54/1.68
% 3.54/1.68 % SZS status Theorem for theBenchmark.p
% 3.54/1.68
% 3.54/1.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.54/1.68
% 3.54/1.68
%------------------------------------------------------------------------------