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