%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET018-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 : 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:06 PM UTC 2026
% Result : Unsatisfiable 4.00s 1.27s
% Output : CNFRefutation 4.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 16 ( 11 unt; 0 def)
% Number of atoms : 26 ( 18 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 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(f173,axiom,
! [X2,X3,X0,X1] :
( X1 = X3
| ~ member(X1,universal_class)
| ordered_pair(X0,X1) != ordered_pair(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_determines_components2) ).
fof(f191,negated_conjecture,
ordered_pair(w,x) = ordered_pair(y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_1) ).
fof(f192,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_2) ).
fof(f193,negated_conjecture,
x != z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_3) ).
fof(f194,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(f195,plain,
unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x))) = unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))),
inference(definition_unfolding,[],[f191,f194,f194]) ).
fof(f196,plain,
! [X2,X3,X0,X1] :
( X1 = X3
| ~ member(X1,universal_class)
| unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))) != unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X3,X3))) ),
inference(definition_unfolding,[],[f173,f194,f194]) ).
tcf(c_219,negated_conjecture,
unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x))) = unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))),
inference(cnf_transformation,[],[f195]) ).
tcf(c_220,negated_conjecture,
member(x,universal_class),
inference(cnf_transformation,[],[f192]) ).
tcf(c_221,negated_conjecture,
x != z,
inference(cnf_transformation,[],[f193]) ).
tcf(c_222,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X1 = X3 )
| ~ member(X1,universal_class)
| ( unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))) != unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X3,X3))) ) ),
inference(cnf_transformation,[],[f196]) ).
tcf(c_2680,plain,
! [X0: $i,X1: $i] :
( ( x = z )
| ~ member(x,universal_class)
| ( unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(x,x))) != unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(z,z))) ) ),
inference(instantiation,[status(thm)],[c_222]) ).
tcf(c_3928,plain,
( ( x = z )
| ~ member(x,universal_class)
| ( unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x))) != unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))) ) ),
inference(instantiation,[status(thm)],[c_2680]) ).
tcf(c_3929,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3928,c_219,c_221,c_220]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET018-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.09/0.36 % Computer : n002.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 09:14:36 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 4.00/1.27 % SZS status Started for theBenchmark.p
% 4.00/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 4.00/1.27
% 4.00/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.00/1.27
% 4.00/1.27 % ------ iProver source info
% 4.00/1.27
% 4.00/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 4.00/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.00/1.27 % git: non_committed_changes: false
% 4.00/1.27
% 4.00/1.27 % ------ Parsing...% successful
% 4.00/1.27
% 4.00/1.27
% 4.00/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.00/1.27
% 4.00/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.00/1.27
% 4.00/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.00/1.27
% 4.00/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.00/1.27 % ------ Proving...
% 4.00/1.27 % ------ Problem Properties
% 4.00/1.27
% 4.00/1.27 %
% 4.00/1.27 % clauses 52
% 4.00/1.27 % conjectures 3
% 4.00/1.27 % EPR 11
% 4.00/1.27 % Horn 42
% 4.00/1.27 % unary 16
% 4.00/1.27 % binary 19
% 4.00/1.27 % lits 106
% 4.00/1.27 % lits eq 35
% 4.00/1.27 % fd_pure 0
% 4.00/1.27 % fd_pseudo 0
% 4.00/1.27 % fd_cond 1
% 4.00/1.27 % fd_pseudo_cond 11
% 4.00/1.27 % AC symbols 0
% 4.00/1.27
% 4.00/1.27 % ------ Schedule dynamic 5 is on
% 4.00/1.27
% 4.00/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.00/1.27
% 4.00/1.27
% 4.00/1.27 % ------
% 4.00/1.27 % Current options:
% 4.00/1.27 % ------
% 4.00/1.27
% 4.00/1.27
% 4.00/1.27 %
% 4.00/1.27
% 4.00/1.27 % ------ Proving...
% 4.00/1.27 %
% 4.00/1.27
% 4.00/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 4.00/1.27
% 4.00/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.00/1.27
% 4.00/1.27
%------------------------------------------------------------------------------