%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET072+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 : n018.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:24 PM UTC 2026
% Result : Theorem 0.79s 1.28s
% Output : CNFRefutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of formulae : 29 ( 12 unt; 0 def)
% Number of atoms : 73 ( 35 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 67 ( 23 ~; 21 |; 20 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 29 !; 6 ?; 6 :)
% 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(f44,conjecture,
! [X0,X1,X2] :
( ( unordered_pair(X0,X2) = unordered_pair(X1,X2)
& member(X1,universal_class)
& member(X0,universal_class) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_cancellation) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ( unordered_pair(X0,X2) = unordered_pair(X1,X2)
& member(X1,universal_class)
& member(X0,universal_class) )
=> X0 = X1 ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f46,plain,
? [X0,X1,X2] :
( unordered_pair(X0,X2) = unordered_pair(X1,X2)
& member(X1,universal_class)
& member(X0,universal_class)
& X0 != X1 ),
inference(ennf_transformation,[],[f45]) ).
fof(f47,plain,
? [X0,X1,X2] :
( unordered_pair(X0,X2) = unordered_pair(X1,X2)
& member(X1,universal_class)
& member(X0,universal_class)
& X0 != X1 ),
inference(flattening,[],[f46]) ).
fof(f49,plain,
( unordered_pair(sK1,sK2) = unordered_pair(sK0,sK2)
& member(sK1,universal_class)
& member(sK0,universal_class)
& sK0 != sK1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f47]) ).
fof(f52,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(f53,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,[],[f52]) ).
fof(f59,plain,
unordered_pair(sK1,sK2) = unordered_pair(sK0,sK2),
inference(cnf_transformation,[],[f49]) ).
fof(f60,plain,
member(sK1,universal_class),
inference(cnf_transformation,[],[f49]) ).
fof(f61,plain,
member(sK0,universal_class),
inference(cnf_transformation,[],[f49]) ).
fof(f62,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f49]) ).
fof(f69,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f53]) ).
fof(f72,plain,
! [X2,X0,X1] :
( X0 != X1
| ~ member(X0,universal_class)
| member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f53]) ).
fof(f86,plain,
! [X2,X1] :
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(equality_resolution,[],[f72]) ).
tcf(c_49,negated_conjecture,
sK0 != sK1,
inference(cnf_transformation,[],[f62]) ).
tcf(c_50,negated_conjecture,
member(sK0,universal_class),
inference(cnf_transformation,[],[f61]) ).
tcf(c_51,negated_conjecture,
member(sK1,universal_class),
inference(cnf_transformation,[],[f60]) ).
tcf(c_52,negated_conjecture,
unordered_pair(sK0,sK2) = unordered_pair(sK1,sK2),
inference(cnf_transformation,[],[f59]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( X0 = X1 )
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f69]) ).
tcf(c_526,plain,
( member(sK1,unordered_pair(sK0,sK2))
| ~ member(sK1,universal_class) ),
inference(superposition,[status(thm)],[c_52,c_57]) ).
tcf(c_527,plain,
member(sK1,unordered_pair(sK0,sK2)),
inference(forward_subsumption_resolution,[status(thm)],[c_526,c_51]) ).
tcf(c_655,plain,
( ( sK1 = sK2 )
| ( sK0 = sK1 ) ),
inference(superposition,[status(thm)],[c_527,c_60]) ).
tcf(c_658,plain,
sK1 = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_655,c_49]) ).
tcf(c_670,plain,
unordered_pair(sK0,sK1) = unordered_pair(sK1,sK1),
inference(demodulation,[status(thm)],[c_52,c_658]) ).
tcf(c_711,plain,
! [X0: $i] :
( ( X0 = sK1 )
| ~ member(X0,unordered_pair(sK0,sK1)) ),
inference(superposition,[status(thm)],[c_670,c_60]) ).
tcf(c_783,plain,
( ( sK0 = sK1 )
| ~ member(sK0,universal_class) ),
inference(superposition,[status(thm)],[c_57,c_711]) ).
tcf(c_788,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_783,c_49,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET072+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.35 % Computer : n018.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Thu Sep 24 09:37:33 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/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.14/0.40
% 0.14/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.40
% 0.14/0.40 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 0.79/1.28 % SZS status Started for theBenchmark.p
% 0.79/1.28 % SZS status Theorem for theBenchmark.p
% 0.79/1.28
% 0.79/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.79/1.28
% 0.79/1.28 % ------ iProver source info
% 0.79/1.28
% 0.79/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 0.79/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.79/1.28 % git: non_committed_changes: false
% 0.79/1.28
% 0.79/1.28 % ------ Parsing...
% 0.79/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.79/1.28
% 0.79/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 %
% 0.79/1.28
% 0.79/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.79/1.28
% 0.79/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.79/1.28 % ------ Proving...
% 0.79/1.28 % ------ Problem Properties
% 0.79/1.28
% 0.79/1.28 %
% 0.79/1.28 % clauses 18
% 0.79/1.28 % conjectures 4
% 0.79/1.28 % EPR 7
% 0.79/1.28 % Horn 16
% 0.79/1.28 % unary 7
% 0.79/1.28 % binary 7
% 0.79/1.28 % lits 33
% 0.79/1.28 % lits eq 5
% 0.79/1.28 % fd_pure 0
% 0.79/1.28 % fd_pseudo 0
% 0.79/1.28 % fd_cond 0
% 0.79/1.28 % fd_pseudo_cond 2
% 0.79/1.28 % AC symbols 0
% 0.79/1.28
% 0.79/1.28 % ------ Schedule dynamic 5 is on
% 0.79/1.28
% 0.79/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.79/1.28
% 0.79/1.28
% 0.79/1.28 % ------
% 0.79/1.28 % Current options:
% 0.79/1.28 % ------
% 0.79/1.28
% 0.79/1.28
% 0.79/1.28 %
% 0.79/1.28
% 0.79/1.28 % ------ Proving...
% 0.79/1.28 %
% 0.79/1.28
% 0.79/1.28 % SZS status Theorem for theBenchmark.p
% 0.79/1.28
% 0.79/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.79/1.28
% 0.79/1.28
%------------------------------------------------------------------------------