%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET016+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 : n017.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:03 PM UTC 2026
% Result : Theorem 4.36s 1.31s
% Output : CNFRefutation 4.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 18 unt; 0 def)
% Number of atoms : 83 ( 45 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 68 ( 24 ~; 26 |; 15 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 45 !; 8 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(f5,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(f7,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',ordered_pair_defn) ).
fof(f44,conjecture,
! [X0,X1,X2,X3] :
( ( member(X0,universal_class)
& ordered_pair(X0,X1) = ordered_pair(X2,X3) )
=> X0 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_determines_components1) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( member(X0,universal_class)
& ordered_pair(X0,X1) = ordered_pair(X2,X3) )
=> X0 = X2 ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f60,plain,
? [X0,X1,X2,X3] :
( member(X0,universal_class)
& ordered_pair(X0,X1) = ordered_pair(X2,X3)
& X0 != X2 ),
inference(ennf_transformation,[],[f45]) ).
fof(f61,plain,
? [X0,X1,X2,X3] :
( member(X0,universal_class)
& ordered_pair(X0,X1) = ordered_pair(X2,X3)
& X0 != X2 ),
inference(flattening,[],[f60]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ( ~ member(X0,unordered_pair(X1,X2))
| ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) )
& ( ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class)
| member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ( ~ member(X0,unordered_pair(X1,X2))
| ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) )
& ( ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class)
| member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f67]) ).
fof(f104,plain,
( member(sK6,universal_class)
& ordered_pair(sK6,sK7) = ordered_pair(sK8,sK9)
& sK6 != sK8 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8),skolemize(X3,sK9)],[f61]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f68]) ).
fof(f115,plain,
! [X2,X0,X1] :
( X0 != X1
| ~ member(X0,universal_class)
| member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f68]) ).
fof(f116,plain,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f5]) ).
fof(f117,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f118,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
inference(cnf_transformation,[],[f7]) ).
fof(f192,plain,
member(sK6,universal_class),
inference(cnf_transformation,[],[f104]) ).
fof(f193,plain,
ordered_pair(sK6,sK7) = ordered_pair(sK8,sK9),
inference(cnf_transformation,[],[f104]) ).
fof(f194,plain,
sK6 != sK8,
inference(cnf_transformation,[],[f104]) ).
fof(f195,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f118,f117,f117]) ).
fof(f232,plain,
unordered_pair(unordered_pair(sK6,sK6),unordered_pair(sK6,unordered_pair(sK7,sK7))) = unordered_pair(unordered_pair(sK8,sK8),unordered_pair(sK8,unordered_pair(sK9,sK9))),
inference(definition_unfolding,[],[f193,f195,f195]) ).
fof(f235,plain,
! [X2,X1] :
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(equality_resolution,[],[f115]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f235]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( X0 = X1 )
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f112]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f116]) ).
tcf(c_128,negated_conjecture,
sK6 != sK8,
inference(cnf_transformation,[],[f194]) ).
tcf(c_129,negated_conjecture,
unordered_pair(unordered_pair(sK6,sK6),unordered_pair(sK6,unordered_pair(sK7,sK7))) = unordered_pair(unordered_pair(sK8,sK8),unordered_pair(sK8,unordered_pair(sK9,sK9))),
inference(cnf_transformation,[],[f232]) ).
tcf(c_130,negated_conjecture,
member(sK6,universal_class),
inference(cnf_transformation,[],[f192]) ).
tcf(c_179,plain,
( member(unordered_pair(sK8,sK8),unordered_pair(unordered_pair(sK6,sK6),unordered_pair(sK6,unordered_pair(sK7,sK7))))
| ~ member(unordered_pair(sK8,sK8),universal_class) ),
inference(superposition,[status(thm)],[c_129,c_56]) ).
tcf(c_194,plain,
member(unordered_pair(sK8,sK8),unordered_pair(unordered_pair(sK6,sK6),unordered_pair(sK6,unordered_pair(sK7,sK7)))),
inference(forward_subsumption_resolution,[status(thm)],[c_179,c_60]) ).
tcf(c_195,plain,
( ( unordered_pair(sK6,sK6) = unordered_pair(sK8,sK8) )
| ( unordered_pair(sK6,unordered_pair(sK7,sK7)) = unordered_pair(sK8,sK8) ) ),
inference(superposition,[status(thm)],[c_194,c_59]) ).
tcf(c_243,plain,
( member(sK6,unordered_pair(sK8,sK8))
| ( unordered_pair(sK6,sK6) = unordered_pair(sK8,sK8) )
| ~ member(sK6,universal_class) ),
inference(superposition,[status(thm)],[c_195,c_56]) ).
tcf(c_250,plain,
( member(unordered_pair(sK8,sK8),unordered_pair(unordered_pair(sK6,sK6),unordered_pair(sK8,sK8)))
| ( unordered_pair(sK6,sK6) = unordered_pair(sK8,sK8) ) ),
inference(superposition,[status(thm)],[c_195,c_194]) ).
tcf(c_360,plain,
( member(sK6,unordered_pair(sK8,sK8))
| ( unordered_pair(sK6,sK6) = unordered_pair(sK8,sK8) ) ),
inference(global_subsumption_just,[status(thm)],[c_243,c_130,c_243]) ).
tcf(c_366,plain,
( ( sK6 = sK8 )
| ( unordered_pair(sK6,sK6) = unordered_pair(sK8,sK8) ) ),
inference(superposition,[status(thm)],[c_360,c_59]) ).
tcf(c_369,plain,
unordered_pair(sK6,sK6) = unordered_pair(sK8,sK8),
inference(global_subsumption_just,[status(thm)],[c_250,c_128,c_366]) ).
tcf(c_374,plain,
! [X0: $i] :
( ( X0 = sK8 )
| ~ member(X0,unordered_pair(sK6,sK6)) ),
inference(superposition,[status(thm)],[c_369,c_59]) ).
tcf(c_565,plain,
( ( sK6 = sK8 )
| ~ member(sK6,universal_class) ),
inference(superposition,[status(thm)],[c_56,c_374]) ).
tcf(c_568,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_565,c_128,c_130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET016+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.12/0.37 % Computer : n017.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:04:02 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 4.36/1.31 % SZS status Started for theBenchmark.p
% 4.36/1.31 % SZS status Theorem for theBenchmark.p
% 4.36/1.31
% 4.36/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.36/1.31
% 4.36/1.31 % ------ iProver source info
% 4.36/1.31
% 4.36/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 4.36/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.36/1.31 % git: non_committed_changes: false
% 4.36/1.31
% 4.36/1.31 % ------ Parsing...
% 4.36/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.36/1.31 % ------ Proving...
% 4.36/1.31 % ------ Problem Properties
% 4.36/1.31
% 4.36/1.31 %
% 4.36/1.31 % clauses 82
% 4.36/1.31 % conjectures 3
% 4.36/1.31 % EPR 14
% 4.36/1.31 % Horn 73
% 4.36/1.31 % unary 16
% 4.36/1.31 % binary 44
% 4.36/1.31 % lits 170
% 4.36/1.31 % lits eq 16
% 4.36/1.31 % fd_pure 0
% 4.36/1.31 % fd_pseudo 0
% 4.36/1.31 % fd_cond 4
% 4.36/1.31 % fd_pseudo_cond 3
% 4.36/1.31 % AC symbols 0
% 4.36/1.31
% 4.36/1.31 % ------ Input Options Time Limit: Unbounded
% 4.36/1.31
% 4.36/1.31
% 4.36/1.31 % ------
% 4.36/1.31 % Current options:
% 4.36/1.31 % ------
% 4.36/1.31
% 4.36/1.31
% 4.36/1.31 %
% 4.36/1.31
% 4.36/1.31 % ------ Proving...
% 4.36/1.31 %
% 4.36/1.31
% 4.36/1.31 % SZS status Theorem for theBenchmark.p
% 4.36/1.31
% 4.36/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.36/1.32
% 4.36/1.32
%------------------------------------------------------------------------------