%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET104-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 : n006.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:37 PM UTC 2026
% Result : Unsatisfiable 3.63s 11.30s
% Output : CNFRefutation 3.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 36 ( 30 unt; 6 def)
% Number of atoms : 77 ( 32 equ)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 13 ( 7 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 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; 4 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 19 !; 0 ?; 6 :)
% 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(f120,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_unordered_pair) ).
fof(f123,axiom,
! [X0,X1] :
( unordered_pair(X1,X0) = singleton(X1)
| member(X0,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_equals_singleton1) ).
fof(f138,axiom,
! [X0] :
( singleton(X0) = null_class
| member(X0,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_is_null_class) ).
fof(f166,negated_conjecture,
unordered_pair(null_class,singleton(singleton(y))) != ordered_pair(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_2_of_ordered_pair_2) ).
fof(f167,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_2_of_ordered_pair_3) ).
fof(f172,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(f223,plain,
! [X0,X1] :
( unordered_pair(X1,X0) = unordered_pair(X1,X1)
| member(X0,universal_class) ),
inference(definition_unfolding,[],[f123,f12]) ).
fof(f234,plain,
! [X0] :
( unordered_pair(X0,X0) = null_class
| member(X0,universal_class) ),
inference(definition_unfolding,[],[f138,f12]) ).
fof(f253,plain,
unordered_pair(null_class,unordered_pair(unordered_pair(y,y),unordered_pair(y,y))) != unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),
inference(definition_unfolding,[],[f166,f12,f12,f172]) ).
tcf(c_290,plain,
! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f120]) ).
tcf(c_293,plain,
! [X0: $i,X1: $i] :
( member(X1,universal_class)
| ( unordered_pair(X0,X0) = unordered_pair(X0,X1) ) ),
inference(cnf_transformation,[],[f223]) ).
tcf(c_308,plain,
! [X0: $i] :
( member(X0,universal_class)
| ( unordered_pair(X0,X0) = null_class ) ),
inference(cnf_transformation,[],[f234]) ).
tcf(c_329,negated_conjecture,
unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))) != unordered_pair(null_class,unordered_pair(unordered_pair(y,y),unordered_pair(y,y))),
inference(cnf_transformation,[],[f253]) ).
tcf(c_330,negated_conjecture,
~ member(x,universal_class),
inference(cnf_transformation,[],[f167]) ).
tcf(c_3737,definition,
iPr_def_10 = unordered_pair(x,x),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_3738,definition,
iPr_def_11 = unordered_pair(y,y),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_3739,definition,
iPr_def_12 = unordered_pair(x,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_3740,definition,
iPr_def_13 = unordered_pair(iPr_def_10,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_3741,definition,
iPr_def_14 = unordered_pair(iPr_def_11,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_3742,definition,
iPr_def_15 = unordered_pair(null_class,iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_3743,negated_conjecture,
~ member(x,universal_class),
inference(demodulation,[status(thm)],[c_330]) ).
tcf(c_3744,negated_conjecture,
iPr_def_13 != iPr_def_15,
inference(demodulation,[status(thm)],[c_329,c_3741,c_3742,c_3738,c_3739,c_3737,c_3740]) ).
tcf(c_4960,plain,
unordered_pair(iPr_def_11,x) = iPr_def_12,
inference(demodulation,[status(thm)],[c_3739,c_290]) ).
tcf(c_4964,plain,
unordered_pair(iPr_def_14,null_class) = iPr_def_15,
inference(demodulation,[status(thm)],[c_3742,c_290]) ).
tcf(c_5209,plain,
unordered_pair(x,x) = null_class,
inference(superposition,[status(thm)],[c_308,c_3743]) ).
tcf(c_5211,plain,
null_class = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_5209,c_3737]) ).
tcf(c_5224,plain,
unordered_pair(iPr_def_14,iPr_def_10) = iPr_def_15,
inference(demodulation,[status(thm)],[c_4964,c_5211]) ).
tcf(c_5273,plain,
unordered_pair(iPr_def_10,iPr_def_14) = iPr_def_15,
inference(demodulation,[status(thm)],[c_5224,c_290]) ).
tcf(c_5727,plain,
! [X0: $i] : unordered_pair(X0,X0) = unordered_pair(X0,x),
inference(superposition,[status(thm)],[c_293,c_3743]) ).
tcf(c_5737,plain,
unordered_pair(iPr_def_11,iPr_def_11) = iPr_def_12,
inference(demodulation,[status(thm)],[c_4960,c_5727]) ).
tcf(c_5738,plain,
iPr_def_12 = iPr_def_14,
inference(demodulation,[status(thm)],[c_3741,c_5737]) ).
tcf(c_5741,plain,
unordered_pair(iPr_def_10,iPr_def_12) = iPr_def_15,
inference(demodulation,[status(thm)],[c_5273,c_5738]) ).
tcf(c_5750,plain,
iPr_def_13 = iPr_def_15,
inference(light_normalisation,[status(thm)],[c_5741,c_3740]) ).
tcf(c_5751,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5750,c_3744]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET104-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.11/10.39 % Computer : n006.cluster.edu
% 0.11/10.39 % Model : x86_64 x86_64
% 0.11/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39 % Memory : 8046.5625MB
% 0.11/10.39 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Thu Sep 24 09:50:08 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.11/10.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/10.43 Running first-order theorem proving
% 0.14/10.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.14/10.44
% 0.14/10.44 % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.44
% 0.14/10.45 % Detected problem language: tptp
% 0.14/10.46 % Proving...
% 3.63/11.30 % SZS status Started for theBenchmark.p
% 3.63/11.30 % SZS status Unsatisfiable for theBenchmark.p
% 3.63/11.30
% 3.63/11.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.63/11.30
% 3.63/11.30 % ------ iProver source info
% 3.63/11.30
% 3.63/11.30 % git: date: 2026-07-19 20:42:38 +0200
% 3.63/11.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.63/11.30 % git: non_committed_changes: false
% 3.63/11.30
% 3.63/11.30 % ------ Parsing...% successful
% 3.63/11.30
% 3.63/11.30
% 3.63/11.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.63/11.30
% 3.63/11.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: 2 0s sf_e pe_s pe_e %
% 3.63/11.30
% 3.63/11.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.63/11.30
% 3.63/11.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.63/11.30 % ------ Proving...
% 3.63/11.30 % ------ Problem Properties
% 3.63/11.30
% 3.63/11.30 %
% 3.63/11.30 % clauses 125
% 3.63/11.30 % conjectures 2
% 3.63/11.30 % EPR 19
% 3.63/11.30 % Horn 101
% 3.63/11.30 % unary 35
% 3.63/11.30 % binary 54
% 3.63/11.30 % lits 258
% 3.63/11.30 % lits eq 73
% 3.63/11.30 % fd_pure 0
% 3.63/11.30 % fd_pseudo 0
% 3.63/11.30 % fd_cond 5
% 3.63/11.30 % fd_pseudo_cond 14
% 3.63/11.30 % AC symbols 0
% 3.63/11.30
% 3.63/11.30 % ------ Schedule dynamic 5 is on
% 3.63/11.30
% 3.63/11.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.63/11.30
% 3.63/11.30
% 3.63/11.30 % ------
% 3.63/11.30 % Current options:
% 3.63/11.30 % ------
% 3.63/11.30
% 3.63/11.30
% 3.63/11.30 %
% 3.63/11.30
% 3.63/11.30 % ------ Proving...
% 3.63/11.30 %
% 3.63/11.30
% 3.63/11.30 % SZS status Unsatisfiable for theBenchmark.p
% 3.63/11.30
% 3.63/11.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.63/11.30
% 3.63/11.30
%------------------------------------------------------------------------------