%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET583+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n012.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:47:27 PM UTC 2026
% Result : Theorem 0.93s 31.10s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 48 ( 16 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 45 ( 18 ~; 11 |; 13 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 18 ( 0 sgn 14 !; 4 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f4,conjecture,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_extensionality) ).
fof(f5,negated_conjecture,
~ ! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> X0 = X1 ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f7,plain,
? [X0,X1] :
( subset(X1,X0)
& subset(X0,X1)
& X0 != X1 ),
inference(ennf_transformation,[],[f5]) ).
fof(f8,plain,
? [X0,X1] :
( subset(X1,X0)
& subset(X0,X1)
& X0 != X1 ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
! [X0,X1] :
( ( X0 != X1
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f10,plain,
! [X0,X1] :
( ( X0 != X1
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ) ),
inference(flattening,[],[f9]) ).
fof(f14,plain,
( subset(sK2,sK1)
& subset(sK1,sK2)
& sK1 != sK2 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f8]) ).
fof(f17,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f10]) ).
fof(f22,plain,
subset(sK2,sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f23,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f14]) ).
fof(f24,plain,
sK1 != sK2,
inference(cnf_transformation,[],[f14]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_56,negated_conjecture,
sK1 != sK2,
inference(cnf_transformation,[],[f24]) ).
tcf(c_57,negated_conjecture,
subset(sK1,sK2),
inference(cnf_transformation,[],[f23]) ).
tcf(c_58,negated_conjecture,
subset(sK2,sK1),
inference(cnf_transformation,[],[f22]) ).
tcf(c_163,negated_conjecture,
subset(sK2,sK1),
inference(demodulation,[status(thm)],[c_58]) ).
tcf(c_164,negated_conjecture,
subset(sK1,sK2),
inference(demodulation,[status(thm)],[c_57]) ).
tcf(c_165,negated_conjecture,
sK1 != sK2,
inference(demodulation,[status(thm)],[c_56]) ).
tcf(c_312,plain,
( ( sK1 = sK2 )
| ~ subset(sK1,sK2) ),
inference(superposition,[status(thm)],[c_163,c_49]) ).
tcf(c_313,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_312,c_165,c_164]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET583+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/30.34 % Computer : n012.cluster.edu
% 0.04/30.34 % Model : x86_64 x86_64
% 0.04/30.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/30.34 % Memory : 8046.5625MB
% 0.04/30.34 % OS : Linux 6.8.0-71-generic
% 0.04/30.34 % CPULimit : 300
% 0.04/30.34 % WCLimit : 300
% 0.04/30.34 % DateTime : Thu Sep 24 11:21:24 UTC 2026
% 0.04/30.34 % CPUTime :
% 0.04/30.34 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/30.36 Running first-order theorem proving
% 0.04/30.36 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.04/30.37
% 0.04/30.37 % ======== iProver multi-core TPTP/SMT =========
% 0.04/30.37
% 0.04/30.37 % Detected problem language: tptp
% 0.04/30.38 % Proving...
% 0.93/31.10 % SZS status Started for theBenchmark.p
% 0.93/31.10 % SZS status Theorem for theBenchmark.p
% 0.93/31.10
% 0.93/31.10 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.93/31.10
% 0.93/31.10 % ------ iProver source info
% 0.93/31.10
% 0.93/31.10 % git: date: 2026-07-19 20:42:38 +0200
% 0.93/31.10 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.93/31.10 % git: non_committed_changes: false
% 0.93/31.10
% 0.93/31.10 % ------ Parsing...
% 0.93/31.10 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.93/31.10
% 0.93/31.10 % ------ 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.93/31.10
% 0.93/31.10 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.93/31.10
% 0.93/31.10 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.93/31.10 % ------ Proving...
% 0.93/31.10 % ------ Problem Properties
% 0.93/31.10
% 0.93/31.10 %
% 0.93/31.10 % clauses 8
% 0.93/31.10 % conjectures 3
% 0.93/31.10 % EPR 6
% 0.93/31.10 % Horn 7
% 0.93/31.10 % unary 4
% 0.93/31.10 % binary 2
% 0.93/31.10 % lits 14
% 0.93/31.10 % lits eq 2
% 0.93/31.10 % fd_pure 0
% 0.93/31.10 % fd_pseudo 0
% 0.93/31.10 % fd_cond 0
% 0.93/31.10 % fd_pseudo_cond 1
% 0.93/31.10 % AC symbols 0
% 0.93/31.10
% 0.93/31.10 % ------ Schedule dynamic 5 is on
% 0.93/31.10
% 0.93/31.10 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.93/31.10
% 0.93/31.10
% 0.93/31.10 % ------
% 0.93/31.10 % Current options:
% 0.93/31.10 % ------
% 0.93/31.10
% 0.93/31.10
% 0.93/31.10 %
% 0.93/31.10
% 0.93/31.10 % ------ Proving...
% 0.93/31.10 %
% 0.93/31.10
% 0.93/31.10 % SZS status Theorem for theBenchmark.p
% 0.93/31.10
% 0.93/31.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.93/31.10
% 0.93/31.10
%------------------------------------------------------------------------------