%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET056+1 : TPTP v9.3.1. Bugfixed v5.4.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:46:17 PM UTC 2026
% Result : Theorem 1.14s 1.29s
% Output : CNFRefutation 1.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 33 ( 6 unt; 0 def)
% Number of atoms : 97 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 107 ( 43 ~; 41 |; 19 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 49 !; 8 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subclass(X1,X0)
& subclass(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',extensionality) ).
fof(f44,conjecture,
! [X0,X1] :
( ? [X3] :
( ~ member(X3,X0)
& member(X3,X1) )
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equality1) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] :
( ? [X3] :
( ~ member(X3,X0)
& member(X3,X1) )
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
| X0 = X1 ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f47,plain,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f60,plain,
? [X0,X1] :
( ! [X3] :
( member(X3,X0)
| ~ member(X3,X1) )
& ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
& X0 != X1 ),
inference(ennf_transformation,[],[f45]) ).
fof(f61,plain,
! [X0,X1] :
( ( ~ subclass(X0,X1)
| ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subclass(X0,X1) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f62,plain,
! [X0,X1] :
( ( ~ subclass(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subclass(X0,X1) ) ),
inference(rectify,[],[f61]) ).
fof(f63,plain,
! [X0,X1] :
( ( ~ subclass(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) ) )
& ( ( member(sK0(X0,X1),X0)
& ~ member(sK0(X0,X1),X1) )
| subclass(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f62]) ).
fof(f64,plain,
! [X0,X1] :
( ( X0 != X1
| ( subclass(X1,X0)
& subclass(X0,X1) ) )
& ( ~ subclass(X1,X0)
| ~ subclass(X0,X1)
| X0 = X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f65,plain,
! [X0,X1] :
( ( X0 != X1
| ( subclass(X1,X0)
& subclass(X0,X1) ) )
& ( ~ subclass(X1,X0)
| ~ subclass(X0,X1)
| X0 = X1 ) ),
inference(flattening,[],[f64]) ).
fof(f103,plain,
( ! [X3] :
( member(X3,sK6)
| ~ member(X3,sK7) )
& ! [X2] :
( member(X2,sK7)
| ~ member(X2,sK6) )
& sK6 != sK7 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f60]) ).
fof(f105,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subclass(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f106,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subclass(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f110,plain,
! [X0,X1] :
( ~ subclass(X1,X0)
| ~ subclass(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f65]) ).
fof(f191,plain,
! [X3] :
( member(X3,sK6)
| ~ member(X3,sK7) ),
inference(cnf_transformation,[],[f103]) ).
fof(f192,plain,
! [X2] :
( member(X2,sK7)
| ~ member(X2,sK6) ),
inference(cnf_transformation,[],[f103]) ).
fof(f193,plain,
sK6 != sK7,
inference(cnf_transformation,[],[f103]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f106]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f105]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ subclass(X1,X0)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
tcf(c_128,negated_conjecture,
sK6 != sK7,
inference(cnf_transformation,[],[f193]) ).
tcf(c_129,negated_conjecture,
! [X0: $i] :
( member(X0,sK7)
| ~ member(X0,sK6) ),
inference(cnf_transformation,[],[f192]) ).
tcf(c_130,negated_conjecture,
! [X0: $i] :
( member(X0,sK6)
| ~ member(X0,sK7) ),
inference(cnf_transformation,[],[f191]) ).
tcf(c_2150,negated_conjecture,
! [X0: $i] :
( member(X0,sK6)
| ~ member(X0,sK7) ),
inference(demodulation,[status(thm)],[c_130]) ).
tcf(c_2151,negated_conjecture,
! [X0: $i] :
( member(X0,sK7)
| ~ member(X0,sK6) ),
inference(demodulation,[status(thm)],[c_129]) ).
tcf(c_2152,negated_conjecture,
sK6 != sK7,
inference(demodulation,[status(thm)],[c_128]) ).
tcf(c_3608,plain,
! [X0: $i] :
( subclass(sK6,X0)
| member(sK0(sK6,X0),sK7) ),
inference(superposition,[status(thm)],[c_50,c_2151]) ).
tcf(c_3609,plain,
! [X0: $i] :
( subclass(sK7,X0)
| member(sK0(sK7,X0),sK6) ),
inference(superposition,[status(thm)],[c_50,c_2150]) ).
tcf(c_3751,plain,
subclass(sK6,sK7),
inference(superposition,[status(thm)],[c_3608,c_49]) ).
tcf(c_3752,plain,
subclass(sK7,sK6),
inference(superposition,[status(thm)],[c_3609,c_49]) ).
tcf(c_4046,plain,
( ( sK6 = sK7 )
| ~ subclass(sK6,sK7) ),
inference(superposition,[status(thm)],[c_3752,c_53]) ).
tcf(c_4047,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4046,c_2152,c_3751]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET056+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n004.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 09:27:36 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.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 1.14/1.29 % SZS status Started for theBenchmark.p
% 1.14/1.29 % SZS status Theorem for theBenchmark.p
% 1.14/1.29
% 1.14/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.14/1.29
% 1.14/1.29 % ------ iProver source info
% 1.14/1.29
% 1.14/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.14/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.14/1.29 % git: non_committed_changes: false
% 1.14/1.29
% 1.14/1.29 % ------ Parsing...
% 1.14/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.14/1.29
% 1.14/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 1.14/1.29
% 1.14/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.14/1.29
% 1.14/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.14/1.29 % ------ Proving...
% 1.14/1.29 % ------ Problem Properties
% 1.14/1.29
% 1.14/1.29 %
% 1.14/1.29 % clauses 77
% 1.14/1.29 % conjectures 3
% 1.14/1.29 % EPR 10
% 1.14/1.29 % Horn 69
% 1.14/1.29 % unary 15
% 1.14/1.29 % binary 41
% 1.14/1.29 % lits 161
% 1.14/1.29 % lits eq 15
% 1.14/1.29 % fd_pure 0
% 1.14/1.29 % fd_pseudo 0
% 1.14/1.29 % fd_cond 4
% 1.14/1.29 % fd_pseudo_cond 3
% 1.14/1.29 % AC symbols 0
% 1.14/1.29
% 1.14/1.29 % ------ Schedule dynamic 5 is on
% 1.14/1.29
% 1.14/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.14/1.29
% 1.14/1.29
% 1.14/1.29 % ------
% 1.14/1.29 % Current options:
% 1.14/1.29 % ------
% 1.14/1.29
% 1.14/1.29
% 1.14/1.29 %
% 1.14/1.29
% 1.14/1.29 % ------ Proving...
% 1.14/1.29 %
% 1.14/1.29
% 1.14/1.29 % SZS status Theorem for theBenchmark.p
% 1.14/1.29
% 1.14/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.14/1.29
% 1.14/1.29
%------------------------------------------------------------------------------