%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET102-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n002.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:36 PM UTC 2026
% Result : Unsatisfiable 3.89s 16.31s
% Output : CNFRefutation 3.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 22 ( 19 unt; 4 def)
% Number of atoms : 43 ( 11 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 7 ~; 3 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 17 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
fof(f11,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pairs_in_universal) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
fof(f13,axiom,
! [X0,X1] : unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))) = ordered_pair(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
fof(f120,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_unordered_pair) ).
fof(f164,negated_conjecture,
~ member(unordered_pair(x,singleton(y)),ordered_pair(x,y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unordered_pair_member_of_ordered_pair_1) ).
fof(f169,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f13,f12,f12]) ).
fof(f248,plain,
~ member(unordered_pair(x,unordered_pair(y,y)),unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y)))),
inference(definition_unfolding,[],[f164,f12,f169]) ).
tcf(c_204,plain,
! [X0: $i,X1: $i] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_206,plain,
! [X0: $i,X1: $i] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f11]) ).
tcf(c_287,plain,
! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f120]) ).
tcf(c_324,negated_conjecture,
~ member(unordered_pair(x,unordered_pair(y,y)),unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y)))),
inference(cnf_transformation,[],[f248]) ).
tcf(c_3714,definition,
iPr_def_10 = unordered_pair(y,y),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_3715,definition,
iPr_def_11 = unordered_pair(x,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_3716,definition,
iPr_def_12 = unordered_pair(x,x),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_3717,definition,
iPr_def_13 = unordered_pair(iPr_def_12,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_3718,negated_conjecture,
~ member(iPr_def_11,iPr_def_13),
inference(demodulation,[status(thm)],[c_324,c_3716,c_3717,c_3714,c_3715]) ).
tcf(c_4913,plain,
unordered_pair(iPr_def_10,x) = iPr_def_11,
inference(demodulation,[status(thm)],[c_3715,c_287]) ).
tcf(c_4914,plain,
member(iPr_def_11,universal_class),
inference(superposition,[status(thm)],[c_4913,c_206]) ).
tcf(c_4916,plain,
unordered_pair(iPr_def_11,iPr_def_12) = iPr_def_13,
inference(demodulation,[status(thm)],[c_3717,c_287]) ).
tcf(c_5040,plain,
( member(iPr_def_11,iPr_def_13)
| ~ member(iPr_def_11,universal_class) ),
inference(superposition,[status(thm)],[c_4916,c_204]) ).
tcf(c_5041,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5040,c_3718,c_4914]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET102-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/15.38 % Computer : n002.cluster.edu
% 0.09/15.38 % Model : x86_64 x86_64
% 0.09/15.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/15.38 % Memory : 8046.5625MB
% 0.09/15.38 % OS : Linux 6.8.0-71-generic
% 0.09/15.38 % CPULimit : 300
% 0.09/15.38 % WCLimit : 300
% 0.09/15.38 % DateTime : Thu Sep 24 09:52:09 UTC 2026
% 0.09/15.39 % CPUTime :
% 0.09/15.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/15.43 Running first-order theorem proving
% 0.15/15.43 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.15/15.44
% 0.15/15.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/15.44
% 0.15/15.44 % Detected problem language: tptp
% 0.15/15.45 % Proving...
% 3.89/16.31 % SZS status Started for theBenchmark.p
% 3.89/16.31 % SZS status Unsatisfiable for theBenchmark.p
% 3.89/16.31
% 3.89/16.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.89/16.31
% 3.89/16.31 % ------ iProver source info
% 3.89/16.31
% 3.89/16.31 % git: date: 2026-07-19 20:42:38 +0200
% 3.89/16.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.89/16.31 % git: non_committed_changes: false
% 3.89/16.31
% 3.89/16.31 % ------ Parsing...% successful
% 3.89/16.31
% 3.89/16.31
% 3.89/16.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.89/16.31
% 3.89/16.31 % ------ 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: 2 0s sf_e pe_s pe_e %
% 3.89/16.31
% 3.89/16.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.89/16.31
% 3.89/16.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.89/16.31 % ------ Proving...
% 3.89/16.31 % ------ Problem Properties
% 3.89/16.31
% 3.89/16.31 %
% 3.89/16.31 % clauses 120
% 3.89/16.31 % conjectures 1
% 3.89/16.31 % EPR 18
% 3.89/16.31 % Horn 96
% 3.89/16.31 % unary 30
% 3.89/16.31 % binary 54
% 3.89/16.32 % lits 253
% 3.89/16.32 % lits eq 70
% 3.89/16.32 % fd_pure 0
% 3.89/16.32 % fd_pseudo 0
% 3.89/16.32 % fd_cond 5
% 3.89/16.32 % fd_pseudo_cond 14
% 3.89/16.32 % AC symbols 0
% 3.89/16.32
% 3.89/16.32 % ------ Schedule dynamic 5 is on
% 3.89/16.32
% 3.89/16.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.89/16.32
% 3.89/16.32
% 3.89/16.32 % ------
% 3.89/16.32 % Current options:
% 3.89/16.32 % ------
% 3.89/16.32
% 3.89/16.32
% 3.89/16.32 %
% 3.89/16.32
% 3.89/16.32 % ------ Proving...
% 3.89/16.32 %
% 3.89/16.32
% 3.89/16.32 % SZS status Unsatisfiable for theBenchmark.p
% 3.89/16.32
% 3.89/16.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.89/16.32
% 3.89/16.32
%------------------------------------------------------------------------------