%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET017+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 : n015.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:04 PM UTC 2026
% Result : Theorem 3.65s 6.49s
% Output : CNFRefutation 3.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 39 ( 21 unt; 2 def)
% Number of atoms : 97 ( 42 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 71 ( 25 ~; 23 |; 20 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 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 : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 30 !; 6 ?; 7 :)
% 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,X1) = unordered_pair(X0,X2)
& member(X2,universal_class)
& member(X1,universal_class) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_cancellation) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = unordered_pair(X0,X2)
& member(X2,universal_class)
& member(X1,universal_class) )
=> X1 = X2 ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f60,plain,
? [X0,X1,X2] :
( unordered_pair(X0,X1) = unordered_pair(X0,X2)
& member(X2,universal_class)
& member(X1,universal_class)
& X1 != X2 ),
inference(ennf_transformation,[],[f45]) ).
fof(f61,plain,
? [X0,X1,X2] :
( unordered_pair(X0,X1) = unordered_pair(X0,X2)
& member(X2,universal_class)
& member(X1,universal_class)
& X1 != 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,
( unordered_pair(sK6,sK7) = unordered_pair(sK6,sK8)
& member(sK8,universal_class)
& member(sK7,universal_class)
& sK7 != sK8 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8)],[f61]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f68]) ).
fof(f114,plain,
! [X2,X0,X1] :
( X0 != X2
| ~ member(X0,universal_class)
| member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f68]) ).
fof(f192,plain,
unordered_pair(sK6,sK7) = unordered_pair(sK6,sK8),
inference(cnf_transformation,[],[f104]) ).
fof(f193,plain,
member(sK8,universal_class),
inference(cnf_transformation,[],[f104]) ).
fof(f194,plain,
member(sK7,universal_class),
inference(cnf_transformation,[],[f104]) ).
fof(f195,plain,
sK7 != sK8,
inference(cnf_transformation,[],[f104]) ).
fof(f236,plain,
! [X2,X1] :
( ~ member(X2,universal_class)
| member(X2,unordered_pair(X1,X2)) ),
inference(equality_resolution,[],[f114]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( member(X0,unordered_pair(X1,X0))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f236]) ).
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_128,negated_conjecture,
sK7 != sK8,
inference(cnf_transformation,[],[f195]) ).
tcf(c_129,negated_conjecture,
member(sK7,universal_class),
inference(cnf_transformation,[],[f194]) ).
tcf(c_130,negated_conjecture,
member(sK8,universal_class),
inference(cnf_transformation,[],[f193]) ).
tcf(c_131,negated_conjecture,
unordered_pair(sK6,sK7) = unordered_pair(sK6,sK8),
inference(cnf_transformation,[],[f192]) ).
tcf(c_1567,definition,
iPr_def_10 = unordered_pair(sK6,sK7),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1568,definition,
iPr_def_11 = unordered_pair(sK6,sK8),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1569,negated_conjecture,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_131,c_1568,c_1567]) ).
tcf(c_1570,negated_conjecture,
member(sK8,universal_class),
inference(demodulation,[status(thm)],[c_130]) ).
tcf(c_1571,negated_conjecture,
member(sK7,universal_class),
inference(demodulation,[status(thm)],[c_129]) ).
tcf(c_1572,negated_conjecture,
sK7 != sK8,
inference(demodulation,[status(thm)],[c_128]) ).
tcf(c_2395,plain,
unordered_pair(sK6,sK8) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_1568,c_1569]) ).
tcf(c_2507,plain,
( member(sK7,iPr_def_10)
| ~ member(sK7,universal_class) ),
inference(superposition,[status(thm)],[c_1567,c_57]) ).
tcf(c_2508,plain,
( member(sK8,iPr_def_10)
| ~ member(sK8,universal_class) ),
inference(superposition,[status(thm)],[c_2395,c_57]) ).
tcf(c_2509,plain,
member(sK8,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_2508,c_1570]) ).
tcf(c_2510,plain,
member(sK7,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_2507,c_1571]) ).
tcf(c_3209,plain,
! [X0: $i] :
( ( X0 = sK6 )
| ( X0 = sK8 )
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_2395,c_59]) ).
tcf(c_3364,plain,
( ( sK7 = sK6 )
| ( sK7 = sK8 ) ),
inference(superposition,[status(thm)],[c_2510,c_3209]) ).
tcf(c_3367,plain,
sK7 = sK6,
inference(forward_subsumption_resolution,[status(thm)],[c_3364,c_1572]) ).
tcf(c_3383,plain,
unordered_pair(sK7,sK7) = iPr_def_10,
inference(demodulation,[status(thm)],[c_1567,c_3367]) ).
tcf(c_3400,plain,
! [X0: $i] :
( ( X0 = sK7 )
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_3383,c_59]) ).
tcf(c_5303,plain,
sK7 = sK8,
inference(superposition,[status(thm)],[c_2509,c_3400]) ).
tcf(c_5306,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5303,c_1572]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET017+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/5.58 % Computer : n015.cluster.edu
% 0.10/5.58 % Model : x86_64 x86_64
% 0.10/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.58 % Memory : 8046.5625MB
% 0.10/5.58 % OS : Linux 6.8.0-71-generic
% 0.10/5.58 % CPULimit : 300
% 0.10/5.58 % WCLimit : 300
% 0.10/5.58 % DateTime : Thu Sep 24 09:13:47 UTC 2026
% 0.10/5.58 % CPUTime :
% 0.10/5.58 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.62 Running first-order theorem proving
% 0.14/5.62 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/5.63
% 0.14/5.63 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.63
% 0.14/5.63 % Detected problem language: tptp
% 0.14/5.64 % Proving...
% 3.65/6.49 % SZS status Started for theBenchmark.p
% 3.65/6.49 % SZS status Theorem for theBenchmark.p
% 3.65/6.49
% 3.65/6.49 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.65/6.49
% 3.65/6.49 % ------ iProver source info
% 3.65/6.49
% 3.65/6.49 % git: date: 2026-07-19 20:42:38 +0200
% 3.65/6.49 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.65/6.49 % git: non_committed_changes: false
% 3.65/6.49
% 3.65/6.49 % ------ Parsing...
% 3.65/6.49 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.65/6.49
% 3.65/6.49 % ------ 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: 4 0s sf_e pe_s pe_e %
% 3.65/6.49
% 3.65/6.49 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.65/6.49
% 3.65/6.49 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.65/6.49 % ------ Proving...
% 3.65/6.49 % ------ Problem Properties
% 3.65/6.49
% 3.65/6.49 %
% 3.65/6.49 % clauses 80
% 3.65/6.49 % conjectures 4
% 3.65/6.49 % EPR 11
% 3.65/6.49 % Horn 72
% 3.65/6.49 % unary 20
% 3.65/6.49 % binary 39
% 3.65/6.49 % lits 162
% 3.65/6.49 % lits eq 18
% 3.65/6.49 % fd_pure 0
% 3.65/6.49 % fd_pseudo 0
% 3.65/6.49 % fd_cond 4
% 3.65/6.49 % fd_pseudo_cond 3
% 3.65/6.49 % AC symbols 0
% 3.65/6.49
% 3.65/6.49 % ------ Schedule dynamic 5 is on
% 3.65/6.49
% 3.65/6.49 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.65/6.49
% 3.65/6.49
% 3.65/6.49 % ------
% 3.65/6.49 % Current options:
% 3.65/6.49 % ------
% 3.65/6.49
% 3.65/6.49
% 3.65/6.49 %
% 3.65/6.49
% 3.65/6.49 % ------ Proving...
% 3.65/6.49 %
% 3.65/6.49
% 3.65/6.49 % SZS status Theorem for theBenchmark.p
% 3.65/6.49
% 3.65/6.49 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.65/6.49
% 3.65/6.49
%------------------------------------------------------------------------------