%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET115-7 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n015.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 1.58s 1.29s
% Output : CNFRefutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 26 ( 21 unt; 6 def)
% Number of atoms : 55 ( 30 equ)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 15 ( 10 ~; 5 |; 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 : 8 ( 6 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn 8 !; 0 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
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(f177,axiom,
! [X0] :
( first(X0) = X0
| ordered_pair(first(X0),second(X0)) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_1st_and_2nd_4) ).
fof(f181,negated_conjecture,
ordered_pair(first(x),second(x)) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_non_sets3_1) ).
fof(f182,plain,
x != ordered_pair(first(x),second(x)),
inference(reorient_equations,[],[f181]) ).
fof(f183,negated_conjecture,
first(x) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unique_1st_in_pair_of_non_sets) ).
fof(f184,plain,
x != first(x),
inference(reorient_equations,[],[f183]) ).
fof(f189,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(f278,plain,
! [X0] :
( first(X0) = X0
| unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))) = X0 ),
inference(definition_unfolding,[],[f177,f189]) ).
fof(f282,plain,
x != unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x)))),
inference(definition_unfolding,[],[f182,f189]) ).
tcf(c_349,plain,
! [X0: $i] :
( ( first(X0) = X0 )
| ( unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))) = X0 ) ),
inference(cnf_transformation,[],[f278]) ).
tcf(c_353,negated_conjecture,
unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x)))) != x,
inference(cnf_transformation,[],[f282]) ).
tcf(c_354,negated_conjecture,
first(x) != x,
inference(cnf_transformation,[],[f184]) ).
tcf(c_4042,definition,
iPr_def_10 = first(x),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_4043,definition,
iPr_def_11 = unordered_pair(iPr_def_10,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_4044,definition,
iPr_def_12 = second(x),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_4045,definition,
iPr_def_13 = unordered_pair(iPr_def_12,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_4046,definition,
iPr_def_14 = unordered_pair(iPr_def_10,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_4047,definition,
iPr_def_15 = unordered_pair(iPr_def_11,iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_4048,negated_conjecture,
iPr_def_15 != x,
inference(demodulation,[status(thm)],[c_353,c_4044,c_4045,c_4046,c_4042,c_4043,c_4047]) ).
tcf(c_4049,negated_conjecture,
iPr_def_10 != x,
inference(demodulation,[status(thm)],[c_354]) ).
tcf(c_5403,plain,
( ( first(x) = x )
| ( unordered_pair(unordered_pair(iPr_def_10,iPr_def_10),unordered_pair(iPr_def_10,unordered_pair(second(x),second(x)))) = x ) ),
inference(superposition,[status(thm)],[c_4042,c_349]) ).
tcf(c_5411,plain,
( ( x = iPr_def_15 )
| ( x = iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_5403,c_4042,c_4043,c_4044,c_4045,c_4046,c_4047]) ).
tcf(c_5472,plain,
x = iPr_def_10,
inference(superposition,[status(thm)],[c_5411,c_4048]) ).
tcf(c_5475,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_4049,c_5472]) ).
tcf(c_5477,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_5475]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET115-7 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.37 % Computer : n015.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Thu Sep 24 09:56:57 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/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.12/0.42
% 0.12/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42
% 0.12/0.42 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 1.58/1.29 % SZS status Started for theBenchmark.p
% 1.58/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.58/1.29
% 1.58/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.58/1.29
% 1.58/1.29 % ------ iProver source info
% 1.58/1.29
% 1.58/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.58/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.58/1.29 % git: non_committed_changes: false
% 1.58/1.29
% 1.58/1.29 % ------ Parsing...% successful
% 1.58/1.29
% 1.58/1.29
% 1.58/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.58/1.29
% 1.58/1.29 % ------ 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 %
% 1.58/1.29
% 1.58/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.58/1.29
% 1.58/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.58/1.29 % ------ Proving...
% 1.58/1.29 % ------ Problem Properties
% 1.58/1.29
% 1.58/1.29 %
% 1.58/1.29 % clauses 137
% 1.58/1.29 % conjectures 2
% 1.58/1.29 % EPR 19
% 1.58/1.29 % Horn 106
% 1.58/1.29 % unary 35
% 1.58/1.29 % binary 62
% 1.58/1.29 % lits 286
% 1.58/1.29 % lits eq 89
% 1.58/1.29 % fd_pure 0
% 1.58/1.29 % fd_pseudo 0
% 1.58/1.29 % fd_cond 5
% 1.58/1.29 % fd_pseudo_cond 16
% 1.58/1.29 % AC symbols 0
% 1.58/1.29
% 1.58/1.29 % ------ Schedule dynamic 5 is on
% 1.58/1.29
% 1.58/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.58/1.29
% 1.58/1.29
% 1.58/1.29 % ------
% 1.58/1.29 % Current options:
% 1.58/1.29 % ------
% 1.58/1.29
% 1.58/1.29
% 1.58/1.29 %
% 1.58/1.29
% 1.58/1.29 % ------ Proving...
% 1.58/1.29 %
% 1.58/1.29
% 1.58/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.58/1.29
% 1.58/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.58/1.29
% 1.58/1.29
%------------------------------------------------------------------------------