%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET020+1 : TPTP v9.3.1. Bugfixed v5.4.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 : Theorem 1.22s 1.28s
% Output : CNFRefutation 1.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 69 ( 38 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 67 ( 26 ~; 19 |; 19 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 22 !; 6 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( ( member(X1,universal_class)
& member(X0,universal_class) )
=> ( second(ordered_pair(X0,X1)) = X1
& first(ordered_pair(X0,X1)) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',first_second) ).
fof(f44,conjecture,
! [X0,X1,X2] :
( ( X2 = ordered_pair(X0,X1)
& member(X1,universal_class)
& member(X0,universal_class) )
=> ( second(X2) = X1
& first(X2) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unique_1st_and_2nd_in_pair_of_sets1) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ( X2 = ordered_pair(X0,X1)
& member(X1,universal_class)
& member(X0,universal_class) )
=> ( second(X2) = X1
& first(X2) = X0 ) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f46,plain,
? [X0,X1,X2] :
( X2 = ordered_pair(X0,X1)
& member(X1,universal_class)
& member(X0,universal_class)
& ( second(X2) != X1
| first(X2) != X0 ) ),
inference(ennf_transformation,[],[f45]) ).
fof(f47,plain,
? [X0,X1,X2] :
( X2 = ordered_pair(X0,X1)
& member(X1,universal_class)
& member(X0,universal_class)
& ( second(X2) != X1
| first(X2) != X0 ) ),
inference(flattening,[],[f46]) ).
fof(f49,plain,
! [X0,X1] :
( ~ member(X1,universal_class)
| ~ member(X0,universal_class)
| ( second(ordered_pair(X0,X1)) = X1
& first(ordered_pair(X0,X1)) = X0 ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f50,plain,
! [X0,X1] :
( ~ member(X1,universal_class)
| ~ member(X0,universal_class)
| ( second(ordered_pair(X0,X1)) = X1
& first(ordered_pair(X0,X1)) = X0 ) ),
inference(flattening,[],[f49]) ).
fof(f52,plain,
( sK2 = ordered_pair(sK0,sK1)
& member(sK1,universal_class)
& member(sK0,universal_class)
& ( sK1 != second(sK2)
| sK0 != first(sK2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f47]) ).
fof(f60,plain,
sK2 = ordered_pair(sK0,sK1),
inference(cnf_transformation,[],[f52]) ).
fof(f61,plain,
member(sK1,universal_class),
inference(cnf_transformation,[],[f52]) ).
fof(f62,plain,
member(sK0,universal_class),
inference(cnf_transformation,[],[f52]) ).
fof(f63,plain,
( sK1 != second(sK2)
| sK0 != first(sK2) ),
inference(cnf_transformation,[],[f52]) ).
fof(f71,plain,
! [X0,X1] :
( ~ member(X1,universal_class)
| ~ member(X0,universal_class)
| second(ordered_pair(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f50]) ).
fof(f72,plain,
! [X0,X1] :
( ~ member(X1,universal_class)
| ~ member(X0,universal_class)
| first(ordered_pair(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_49,negated_conjecture,
( ( second(sK2) != sK1 )
| ( first(sK2) != sK0 ) ),
inference(cnf_transformation,[],[f63]) ).
tcf(c_50,negated_conjecture,
member(sK0,universal_class),
inference(cnf_transformation,[],[f62]) ).
tcf(c_51,negated_conjecture,
member(sK1,universal_class),
inference(cnf_transformation,[],[f61]) ).
tcf(c_52,negated_conjecture,
ordered_pair(sK0,sK1) = sK2,
inference(cnf_transformation,[],[f60]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( ( first(ordered_pair(X0,X1)) = X0 )
| ~ member(X1,universal_class)
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f72]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( ( second(ordered_pair(X0,X1)) = X1 )
| ~ member(X1,universal_class)
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f71]) ).
tcf(c_772,plain,
! [X0: $i] :
( ( first(ordered_pair(sK0,X0)) = sK0 )
| ~ member(X0,universal_class) ),
inference(superposition,[status(thm)],[c_50,c_60]) ).
tcf(c_802,plain,
! [X0: $i] :
( ( second(ordered_pair(sK0,X0)) = X0 )
| ~ member(X0,universal_class) ),
inference(superposition,[status(thm)],[c_50,c_61]) ).
tcf(c_856,plain,
first(ordered_pair(sK0,sK1)) = sK0,
inference(superposition,[status(thm)],[c_51,c_772]) ).
tcf(c_860,plain,
first(sK2) = sK0,
inference(light_normalisation,[status(thm)],[c_856,c_52]) ).
tcf(c_866,plain,
second(sK2) != sK1,
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_860]) ).
tcf(c_899,plain,
second(ordered_pair(sK0,sK1)) = sK1,
inference(superposition,[status(thm)],[c_51,c_802]) ).
tcf(c_903,plain,
second(sK2) = sK1,
inference(light_normalisation,[status(thm)],[c_899,c_52]) ).
tcf(c_904,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_903,c_866]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET020+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n002.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 09:15:19 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.22/1.28 % SZS status Started for theBenchmark.p
% 1.22/1.28 % SZS status Theorem for theBenchmark.p
% 1.22/1.28
% 1.22/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.22/1.28
% 1.22/1.28 % ------ iProver source info
% 1.22/1.28
% 1.22/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.22/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.22/1.28 % git: non_committed_changes: false
% 1.22/1.28
% 1.22/1.28 % ------ Parsing...
% 1.22/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.22/1.28
% 1.22/1.28 % ------ 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 %
% 1.22/1.28
% 1.22/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.22/1.28
% 1.22/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.22/1.28 % ------ Proving...
% 1.22/1.28 % ------ Problem Properties
% 1.22/1.28
% 1.22/1.28 %
% 1.22/1.28 % clauses 16
% 1.22/1.28 % conjectures 4
% 1.22/1.28 % EPR 6
% 1.22/1.28 % Horn 15
% 1.22/1.28 % unary 5
% 1.22/1.28 % binary 6
% 1.22/1.28 % lits 32
% 1.22/1.28 % lits eq 7
% 1.22/1.28 % fd_pure 0
% 1.22/1.28 % fd_pseudo 0
% 1.22/1.28 % fd_cond 0
% 1.22/1.28 % fd_pseudo_cond 1
% 1.22/1.28 % AC symbols 0
% 1.22/1.28
% 1.22/1.28 % ------ Schedule dynamic 5 is on
% 1.22/1.28
% 1.22/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.22/1.28
% 1.22/1.28
% 1.22/1.28 % ------
% 1.22/1.28 % Current options:
% 1.22/1.28 % ------
% 1.22/1.28
% 1.22/1.28
% 1.22/1.28 %
% 1.22/1.28
% 1.22/1.28 % ------ Proving...
% 1.22/1.28 %
% 1.22/1.28
% 1.22/1.28 % SZS status Theorem for theBenchmark.p
% 1.22/1.28
% 1.22/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.22/1.28
% 1.22/1.28
%------------------------------------------------------------------------------