%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET067+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 : n018.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:22 PM UTC 2026
% Result : Theorem 3.96s 1.19s
% Output : CNFRefutation 3.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 40 ( 14 unt; 2 def)
% Number of atoms : 117 ( 20 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 96 ( 39 ~; 40 |; 13 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn 59 !; 4 ?; 16 :)
% 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(f4,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(f44,conjecture,
! [X0,X1] : subclass(unordered_pair(X0,X0),unordered_pair(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pair_contains_other) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] : subclass(unordered_pair(X0,X0),unordered_pair(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] : ~ subclass(unordered_pair(X0,X0),unordered_pair(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(f66,plain,
! [X0,X1,X2] :
( ( ~ member(X0,unordered_pair(X1,X2))
| ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) )
& ( ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class)
| member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ( ~ member(X0,unordered_pair(X1,X2))
| ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) )
& ( ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class)
| member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f66]) ).
fof(f103,plain,
~ subclass(unordered_pair(sK6,sK6),unordered_pair(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(f111,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f67]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| member(X0,universal_class) ),
inference(cnf_transformation,[],[f67]) ).
fof(f114,plain,
! [X2,X0,X1] :
( X0 != X1
| ~ member(X0,universal_class)
| member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f67]) ).
fof(f191,plain,
~ subclass(unordered_pair(sK6,sK6),unordered_pair(sK6,sK7)),
inference(cnf_transformation,[],[f103]) ).
fof(f231,plain,
! [X2,X1] :
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(equality_resolution,[],[f114]) ).
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_56,plain,
! [X0: $i,X1: $i] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f231]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,universal_class)
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f112]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( X0 = X1 )
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f111]) ).
tcf(c_128,negated_conjecture,
~ subclass(unordered_pair(sK6,sK6),unordered_pair(sK6,sK7)),
inference(cnf_transformation,[],[f191]) ).
tcf(c_1552,definition,
iPr_def_10 = unordered_pair(sK6,sK6),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1553,definition,
iPr_def_11 = unordered_pair(sK6,sK7),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1554,negated_conjecture,
~ subclass(iPr_def_10,iPr_def_11),
inference(demodulation,[status(thm)],[c_128,c_1553,c_1552]) ).
tcf(c_2449,plain,
( member(sK6,iPr_def_11)
| ~ member(sK6,universal_class) ),
inference(superposition,[status(thm)],[c_1553,c_56]) ).
tcf(c_2482,plain,
! [X0: $i] :
( member(X0,universal_class)
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_1552,c_58]) ).
tcf(c_2500,plain,
! [X0: $i] :
( subclass(iPr_def_10,X0)
| member(sK0(iPr_def_10,X0),universal_class) ),
inference(superposition,[status(thm)],[c_50,c_2482]) ).
tcf(c_3225,plain,
! [X0: $i] :
( ( X0 = sK6 )
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_1552,c_59]) ).
tcf(c_3284,plain,
! [X0: $i] :
( subclass(iPr_def_10,X0)
| ( sK0(iPr_def_10,X0) = sK6 ) ),
inference(superposition,[status(thm)],[c_50,c_3225]) ).
tcf(c_3306,plain,
sK0(iPr_def_10,iPr_def_11) = sK6,
inference(superposition,[status(thm)],[c_3284,c_1554]) ).
tcf(c_3320,plain,
( subclass(iPr_def_10,iPr_def_11)
| ~ member(sK6,iPr_def_11) ),
inference(superposition,[status(thm)],[c_3306,c_49]) ).
tcf(c_3322,plain,
( member(sK6,universal_class)
| subclass(iPr_def_10,iPr_def_11) ),
inference(superposition,[status(thm)],[c_3306,c_2500]) ).
tcf(c_3323,plain,
member(sK6,universal_class),
inference(forward_subsumption_resolution,[status(thm)],[c_3322,c_1554]) ).
tcf(c_3325,plain,
~ member(sK6,iPr_def_11),
inference(forward_subsumption_resolution,[status(thm)],[c_3320,c_1554]) ).
tcf(c_3326,plain,
member(sK6,iPr_def_11),
inference(backward_subsumption_resolution,[status(thm)],[c_2449,c_3323]) ).
tcf(c_3328,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3326,c_3325]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET067+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.37 % Computer : n018.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Thu Sep 24 09:35:20 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.41 Running first-order theorem proving
% 0.08/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.08/0.42
% 0.08/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.42
% 0.08/0.42 % Detected problem language: tptp
% 0.08/0.43 % Proving...
% 3.96/1.19 % SZS status Started for theBenchmark.p
% 3.96/1.19 % SZS status Theorem for theBenchmark.p
% 3.96/1.19
% 3.96/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.96/1.19
% 3.96/1.19 % ------ iProver source info
% 3.96/1.19
% 3.96/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.96/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.96/1.19 % git: non_committed_changes: false
% 3.96/1.19
% 3.96/1.19 % ------ Parsing...
% 3.96/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.96/1.19
% 3.96/1.19 % ------ 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 %
% 3.96/1.19
% 3.96/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.96/1.19
% 3.96/1.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.96/1.19 % ------ Proving...
% 3.96/1.19 % ------ Problem Properties
% 3.96/1.19
% 3.96/1.19 %
% 3.96/1.19 % clauses 77
% 3.96/1.19 % conjectures 1
% 3.96/1.19 % EPR 8
% 3.96/1.19 % Horn 69
% 3.96/1.19 % unary 17
% 3.96/1.19 % binary 39
% 3.96/1.19 % lits 159
% 3.96/1.19 % lits eq 16
% 3.96/1.19 % fd_pure 0
% 3.96/1.19 % fd_pseudo 0
% 3.96/1.19 % fd_cond 4
% 3.96/1.19 % fd_pseudo_cond 3
% 3.96/1.19 % AC symbols 0
% 3.96/1.19
% 3.96/1.19 % ------ Schedule dynamic 5 is on
% 3.96/1.19
% 3.96/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.96/1.19
% 3.96/1.19
% 3.96/1.19 % ------
% 3.96/1.19 % Current options:
% 3.96/1.19 % ------
% 3.96/1.19
% 3.96/1.19
% 3.96/1.19 %
% 3.96/1.19
% 3.96/1.19 % ------ Proving...
% 3.96/1.19 %
% 3.96/1.19
% 3.96/1.19 % SZS status Theorem for theBenchmark.p
% 3.96/1.19
% 3.96/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.96/1.19
% 3.96/1.19
%------------------------------------------------------------------------------