%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU139+1 : 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 : n004.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:33 PM UTC 2026
% Result : Theorem 0.47s 1.28s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 15 unt; 0 def)
% Number of atoms : 75 ( 16 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 78 ( 38 ~; 29 |; 9 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 41 ( 2 sgn 39 !; 2 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( proper_subset(X0,X1)
=> ~ proper_subset(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_xboole_0) ).
fof(f3,axiom,
! [X0,X1] :
( proper_subset(X0,X1)
<=> ( X0 != X1
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(f4,axiom,
! [X0,X1] : ~ proper_subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexivity_r2_xboole_0) ).
fof(f5,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f6,conjecture,
! [X0,X1] :
~ ( proper_subset(X1,X0)
& subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_xboole_1) ).
fof(f7,negated_conjecture,
~ ! [X0,X1] :
~ ( proper_subset(X1,X0)
& subset(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,plain,
! [X0] : ~ proper_subset(X0,X0),
inference(rectify,[],[f4]) ).
fof(f9,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f5]) ).
fof(f10,plain,
! [X0,X1] :
( ~ proper_subset(X0,X1)
| ~ proper_subset(X1,X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f11,plain,
? [X0,X1] :
( proper_subset(X1,X0)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f14,plain,
! [X0,X1] :
( ( ~ proper_subset(X0,X1)
| ( X0 != X1
& subset(X0,X1) ) )
& ( X0 = X1
| ~ subset(X0,X1)
| proper_subset(X0,X1) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f15,plain,
! [X0,X1] :
( ( ~ proper_subset(X0,X1)
| ( X0 != X1
& subset(X0,X1) ) )
& ( X0 = X1
| ~ subset(X0,X1)
| proper_subset(X0,X1) ) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
( proper_subset(sK1,sK0)
& subset(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f11]) ).
fof(f17,plain,
! [X0,X1] :
( ~ proper_subset(X0,X1)
| ~ proper_subset(X1,X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f23,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X0,X1)
| proper_subset(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f24,plain,
! [X0] : ~ proper_subset(X0,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f25,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f9]) ).
fof(f26,plain,
proper_subset(sK1,sK0),
inference(cnf_transformation,[],[f16]) ).
fof(f27,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f16]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( ~ proper_subset(X1,X0)
| ~ proper_subset(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( proper_subset(X0,X1)
| ( X0 = X1 )
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_56,plain,
! [X0: $i] : ~ proper_subset(X0,X0),
inference(cnf_transformation,[],[f24]) ).
tcf(c_57,plain,
! [X0: $i] : subset(X0,X0),
inference(cnf_transformation,[],[f25]) ).
tcf(c_58,negated_conjecture,
subset(sK0,sK1),
inference(cnf_transformation,[],[f27]) ).
tcf(c_59,negated_conjecture,
proper_subset(sK1,sK0),
inference(cnf_transformation,[],[f26]) ).
tcf(c_60,plain,
subset(sK0,sK0),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_61,plain,
~ proper_subset(sK0,sK0),
inference(instantiation,[status(thm)],[c_56]) ).
tcf(c_62,plain,
( proper_subset(sK0,sK0)
| ( sK0 = sK0 )
| ~ subset(sK0,sK0) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_115,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( proper_subset(X0,X2)
| ~ proper_subset(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_119,plain,
( ~ proper_subset(sK1,sK0)
| ~ proper_subset(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_120,plain,
! [X0: $i,X1: $i] :
( proper_subset(X0,X1)
| ~ proper_subset(sK1,sK0)
| ( X1 != sK0 )
| ( X0 != sK1 ) ),
inference(instantiation,[status(thm)],[c_115]) ).
tcf(c_121,plain,
( proper_subset(sK0,sK0)
| ~ proper_subset(sK1,sK0)
| ( sK0 != sK1 )
| ( sK0 != sK0 ) ),
inference(instantiation,[status(thm)],[c_120]) ).
tcf(c_122,plain,
! [X0: $i] :
( proper_subset(X0,sK1)
| ( X0 = sK1 )
| ~ subset(X0,sK1) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_125,plain,
( proper_subset(sK0,sK1)
| ( sK0 = sK1 )
| ~ subset(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_122]) ).
tcf(c_126,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_125,c_121,c_119,c_62,c_61,c_60,c_58,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU139+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 12:54:21 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.39 Running first-order theorem proving
% 0.10/0.39 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.40
% 0.10/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.40
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 0.47/1.28 % SZS status Started for theBenchmark.p
% 0.47/1.28 % SZS status Theorem for theBenchmark.p
% 0.47/1.28
% 0.47/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.47/1.28
% 0.47/1.28 % ------ iProver source info
% 0.47/1.28
% 0.47/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 0.47/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.47/1.28 % git: non_committed_changes: false
% 0.47/1.28
% 0.47/1.28 % ------ Parsing...
% 0.47/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_eq
% 0.47/1.28 %
% 0.47/1.28
% 0.47/1.28 % ------ 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 %
% 0.47/1.28
% 0.47/1.28 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_eq
% 0.47/1.28 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e % ------ preprocesses with Option_epr_non_horn_eq
% 0.47/1.28 %
% 0.47/1.28
% 0.47/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.47/1.28 % ------ Proving...
% 0.47/1.28 % ------ Problem Properties
% 0.47/1.28
% 0.47/1.28 %
% 0.47/1.28 % clauses 8
% 0.47/1.28 % conjectures 2
% 0.47/1.28 % EPR 8
% 0.47/1.28 % Horn 7
% 0.47/1.28 % unary 4
% 0.47/1.28 % binary 2
% 0.47/1.28 % lits 14
% 0.47/1.28 % lits eq 2
% 0.47/1.28 % fd_pure 0
% 0.47/1.28 % fd_pseudo 0
% 0.47/1.28 % fd_cond 0
% 0.47/1.28 % fd_pseudo_cond 2
% 0.47/1.28 % AC symbols 0
% 0.47/1.28
% 0.47/1.28 % ------ Schedule EPR non Horn eq is on
% 0.47/1.28
% 0.47/1.28 % ------ Option_epr_non_horn_eq Time Limit: Unbounded
% 0.47/1.28
% 0.47/1.28
% 0.47/1.28 % ------
% 0.47/1.28 % Current options:
% 0.47/1.28 % ------
% 0.47/1.28
% 0.47/1.28
% 0.47/1.28 %
% 0.47/1.28
% 0.47/1.28 % ------ Proving...
% 0.47/1.28 %
% 0.47/1.28
% 0.47/1.28 % SZS status Theorem for theBenchmark.p
% 0.47/1.28
% 0.47/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.28
% 0.47/1.28
%------------------------------------------------------------------------------