%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET081+1 : TPTP v9.3.1. Bugfixed v5.4.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:46:29 PM UTC 2026
% Result : Theorem 1.45s 11.20s
% Output : CNFRefutation 1.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 12 unt; 1 def)
% Number of atoms : 51 ( 26 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 43 ( 17 ~; 14 |; 9 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 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; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 22 !; 2 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(f44,conjecture,
! [X0,X1] :
( member(X1,singleton(X0))
=> X1 = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',only_member_in_singleton) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] :
( member(X1,singleton(X0))
=> X1 = X0 ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f60,plain,
? [X0,X1] :
( member(X1,singleton(X0))
& X0 != X1 ),
inference(ennf_transformation,[],[f45]) ).
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,
( member(sK7,singleton(sK6))
& sK6 != sK7 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f60]) ).
fof(f111,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f67]) ).
fof(f116,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f191,plain,
member(sK7,singleton(sK6)),
inference(cnf_transformation,[],[f103]) ).
fof(f192,plain,
sK6 != sK7,
inference(cnf_transformation,[],[f103]) ).
fof(f230,plain,
member(sK7,unordered_pair(sK6,sK6)),
inference(definition_unfolding,[],[f191,f116]) ).
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,
sK6 != sK7,
inference(cnf_transformation,[],[f192]) ).
tcf(c_129,negated_conjecture,
member(sK7,unordered_pair(sK6,sK6)),
inference(cnf_transformation,[],[f230]) ).
tcf(c_1557,definition,
iPr_def_10 = unordered_pair(sK6,sK6),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1558,negated_conjecture,
member(sK7,iPr_def_10),
inference(demodulation,[status(thm)],[c_129,c_1557]) ).
tcf(c_1559,negated_conjecture,
sK6 != sK7,
inference(demodulation,[status(thm)],[c_128]) ).
tcf(c_3337,plain,
! [X0: $i] :
( ( X0 = sK6 )
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_1557,c_59]) ).
tcf(c_3444,plain,
sK6 = sK7,
inference(superposition,[status(thm)],[c_1558,c_3337]) ).
tcf(c_3445,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3444,c_1559]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET081+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.06/10.54 % Computer : n012.cluster.edu
% 0.06/10.54 % Model : x86_64 x86_64
% 0.06/10.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/10.54 % Memory : 8046.5625MB
% 0.06/10.54 % OS : Linux 6.8.0-71-generic
% 0.06/10.54 % CPULimit : 300
% 0.06/10.54 % WCLimit : 300
% 0.06/10.54 % DateTime : Thu Sep 24 09:39:02 UTC 2026
% 0.06/10.55 % CPUTime :
% 0.06/10.55 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.06/10.57 Running first-order theorem proving
% 0.06/10.57 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.06/10.57
% 0.06/10.57 % ======== iProver multi-core TPTP/SMT =========
% 0.06/10.57
% 0.06/10.57 % Detected problem language: tptp
% 0.06/10.58 % Proving...
% 1.45/11.20 % SZS status Started for theBenchmark.p
% 1.45/11.20 % SZS status Theorem for theBenchmark.p
% 1.45/11.20
% 1.45/11.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.45/11.20
% 1.45/11.20 % ------ iProver source info
% 1.45/11.20
% 1.45/11.20 % git: date: 2026-07-19 20:42:38 +0200
% 1.45/11.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.45/11.20 % git: non_committed_changes: false
% 1.45/11.20
% 1.45/11.20 % ------ Parsing...
% 1.45/11.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.45/11.20
% 1.45/11.20 % ------ 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.45/11.20
% 1.45/11.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.45/11.20
% 1.45/11.20 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.45/11.20 % ------ Proving...
% 1.45/11.20 % ------ Problem Properties
% 1.45/11.20
% 1.45/11.20 %
% 1.45/11.20 % clauses 77
% 1.45/11.20 % conjectures 2
% 1.45/11.20 % EPR 9
% 1.45/11.20 % Horn 69
% 1.45/11.20 % unary 17
% 1.45/11.20 % binary 39
% 1.45/11.20 % lits 159
% 1.45/11.20 % lits eq 16
% 1.45/11.20 % fd_pure 0
% 1.45/11.20 % fd_pseudo 0
% 1.45/11.20 % fd_cond 4
% 1.45/11.20 % fd_pseudo_cond 3
% 1.45/11.20 % AC symbols 0
% 1.45/11.20
% 1.45/11.20 % ------ Schedule dynamic 5 is on
% 1.45/11.20
% 1.45/11.20 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.45/11.20
% 1.45/11.20
% 1.45/11.20 % ------
% 1.45/11.20 % Current options:
% 1.45/11.20 % ------
% 1.45/11.20
% 1.45/11.20
% 1.45/11.20 %
% 1.45/11.20
% 1.45/11.20 % ------ Proving...
% 1.45/11.20 %
% 1.45/11.20
% 1.45/11.20 % SZS status Theorem for theBenchmark.p
% 1.45/11.20
% 1.45/11.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.45/11.20
% 1.45/11.20
%------------------------------------------------------------------------------