%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET117-6 : 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 : n005.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:39 PM UTC 2026
% Result : Unsatisfiable 2.79s 1.49s
% Output : CNFRefutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 22 ( 22 unt; 6 def)
% Number of atoms : 39 ( 14 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 9 !; 0 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
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(f101,negated_conjecture,
ordered_pair(first(x),second(x)) = x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_ordered_pairs_are_sets_1) ).
fof(f102,plain,
x = ordered_pair(first(x),second(x)),
inference(reorient_equations,[],[f101]) ).
fof(f103,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_ordered_pairs_are_sets_2) ).
fof(f108,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(f152,plain,
x = unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x)))),
inference(definition_unfolding,[],[f102,f108]) ).
tcf(c_152,plain,
! [X0: $i,X1: $i] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f11]) ).
tcf(c_217,negated_conjecture,
unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x)))) = x,
inference(cnf_transformation,[],[f152]) ).
tcf(c_218,negated_conjecture,
~ member(x,universal_class),
inference(cnf_transformation,[],[f103]) ).
tcf(c_2648,definition,
iPr_def_10 = first(x),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2649,definition,
iPr_def_11 = unordered_pair(iPr_def_10,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_2650,definition,
iPr_def_12 = second(x),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_2651,definition,
iPr_def_13 = unordered_pair(iPr_def_12,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_2652,definition,
iPr_def_14 = unordered_pair(iPr_def_10,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_2653,definition,
iPr_def_15 = unordered_pair(iPr_def_11,iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_2654,negated_conjecture,
~ member(x,universal_class),
inference(demodulation,[status(thm)],[c_218]) ).
tcf(c_2655,negated_conjecture,
iPr_def_15 = x,
inference(demodulation,[status(thm)],[c_217,c_2650,c_2651,c_2652,c_2648,c_2649,c_2653]) ).
tcf(c_3444,plain,
~ member(iPr_def_15,universal_class),
inference(light_normalisation,[status(thm)],[c_2654,c_2655]) ).
tcf(c_3452,plain,
member(iPr_def_15,universal_class),
inference(superposition,[status(thm)],[c_2653,c_152]) ).
tcf(c_3453,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3452,c_3444]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET117-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.58 % Computer : n005.cluster.edu
% 0.10/0.58 % Model : x86_64 x86_64
% 0.10/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.58 % Memory : 8046.5625MB
% 0.10/0.58 % OS : Linux 6.8.0-71-generic
% 0.10/0.58 % CPULimit : 300
% 0.10/0.58 % WCLimit : 300
% 0.10/0.58 % DateTime : Thu Sep 24 09:54:03 UTC 2026
% 0.10/0.58 % CPUTime :
% 0.10/0.58 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.62 Running first-order theorem proving
% 0.10/0.62 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.16/0.63
% 0.16/0.63 % ======== iProver multi-core TPTP/SMT =========
% 0.16/0.63
% 0.16/0.63 % Detected problem language: tptp
% 0.16/0.65 % Proving...
% 2.79/1.49 % SZS status Started for theBenchmark.p
% 2.79/1.49 % SZS status Unsatisfiable for theBenchmark.p
% 2.79/1.49
% 2.79/1.49 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.79/1.49
% 2.79/1.49 % ------ iProver source info
% 2.79/1.49
% 2.79/1.49 % git: date: 2026-07-19 20:42:38 +0200
% 2.79/1.49 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.79/1.49 % git: non_committed_changes: false
% 2.79/1.49
% 2.79/1.49 % ------ Parsing...% successful
% 2.79/1.49
% 2.79/1.49
% 2.79/1.49 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.79/1.49
% 2.79/1.49 % ------ 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 %
% 2.79/1.49
% 2.79/1.49 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.79/1.49
% 2.79/1.49 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.79/1.49 % ------ Proving...
% 2.79/1.49 % ------ Problem Properties
% 2.79/1.49
% 2.79/1.49 %
% 2.79/1.49 % clauses 75
% 2.79/1.49 % conjectures 2
% 2.79/1.49 % EPR 14
% 2.79/1.49 % Horn 67
% 2.79/1.49 % unary 23
% 2.79/1.49 % binary 32
% 2.79/1.49 % lits 153
% 2.79/1.49 % lits eq 27
% 2.79/1.49 % fd_pure 0
% 2.79/1.49 % fd_pseudo 0
% 2.79/1.49 % fd_cond 3
% 2.79/1.49 % fd_pseudo_cond 3
% 2.79/1.49 % AC symbols 0
% 2.79/1.49
% 2.79/1.49 % ------ Schedule dynamic 5 is on
% 2.79/1.49
% 2.79/1.49 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.79/1.49
% 2.79/1.49
% 2.79/1.49 % ------
% 2.79/1.49 % Current options:
% 2.79/1.49 % ------
% 2.79/1.49
% 2.79/1.49
% 2.79/1.49 %
% 2.79/1.49
% 2.79/1.49 % ------ Proving...
% 2.79/1.49 %
% 2.79/1.49
% 2.79/1.49 % SZS status Unsatisfiable for theBenchmark.p
% 2.79/1.49
% 2.79/1.49 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.79/1.49
% 2.79/1.49
%------------------------------------------------------------------------------