%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC001+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n011.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 03:07:27 PM UTC 2026
% Result : Theorem 3.84s 1.19s
% Output : CNFRefutation 3.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 29 ( 8 unt; 0 def)
% Number of atoms : 140 ( 12 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 169 ( 58 ~; 56 |; 45 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 29 ( 0 sgn 17 !; 12 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( duplicatefreeP(X0)
& ! [X5] :
( ssItem(X5)
=> ( ( memberP(X0,X5)
& memberP(X1,X5) )
| ( ~ memberP(X0,X5)
& ~ memberP(X1,X5) ) ) ) )
| ? [X4] :
( ( ( memberP(X3,X4)
& ~ memberP(X2,X4) )
| ( memberP(X2,X4)
& ~ memberP(X3,X4) ) )
& ssItem(X4) )
| ~ duplicatefreeP(X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( duplicatefreeP(X0)
& ! [X5] :
( ssItem(X5)
=> ( ( memberP(X0,X5)
& memberP(X1,X5) )
| ( ~ memberP(X0,X5)
& ~ memberP(X1,X5) ) ) ) )
| ? [X4] :
( ( ( memberP(X3,X4)
& ~ memberP(X2,X4) )
| ( memberP(X2,X4)
& ~ memberP(X3,X4) ) )
& ssItem(X4) )
| ~ duplicatefreeP(X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ~ duplicatefreeP(X0)
| ? [X5] :
( ssItem(X5)
& ( ~ memberP(X0,X5)
| ~ memberP(X1,X5) )
& ( memberP(X0,X5)
| memberP(X1,X5) ) ) )
& ! [X4] :
( ( ( ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| memberP(X3,X4) ) )
| ~ ssItem(X4) )
& duplicatefreeP(X2)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ~ duplicatefreeP(X0)
| ? [X5] :
( ssItem(X5)
& ( ~ memberP(X0,X5)
| ~ memberP(X1,X5) )
& ( memberP(X0,X5)
| memberP(X1,X5) ) ) )
& ! [X4] :
( ( ( ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| memberP(X3,X4) ) )
| ~ ssItem(X4) )
& duplicatefreeP(X2)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f125,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ~ duplicatefreeP(sK0)
| ( ssItem(sK4)
& ( ~ memberP(sK0,sK4)
| ~ memberP(sK1,sK4) )
& ( memberP(sK0,sK4)
| memberP(sK1,sK4) ) ) )
& ! [X4] :
( ( ( ~ memberP(sK3,X4)
| memberP(sK2,X4) )
& ( ~ memberP(sK2,X4)
| memberP(sK3,X4) ) )
| ~ ssItem(X4) )
& duplicatefreeP(sK2)
& sK0 = sK2
& sK1 = sK3 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X5,sK4)],[f99]) ).
fof(f144,plain,
( ~ duplicatefreeP(sK0)
| ssItem(sK4) ),
inference(cnf_transformation,[],[f125]) ).
fof(f145,plain,
( ~ duplicatefreeP(sK0)
| ~ memberP(sK0,sK4)
| ~ memberP(sK1,sK4) ),
inference(cnf_transformation,[],[f125]) ).
fof(f146,plain,
( ~ duplicatefreeP(sK0)
| memberP(sK0,sK4)
| memberP(sK1,sK4) ),
inference(cnf_transformation,[],[f125]) ).
fof(f147,plain,
! [X4] :
( ~ memberP(sK3,X4)
| memberP(sK2,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f125]) ).
fof(f148,plain,
! [X4] :
( ~ memberP(sK2,X4)
| memberP(sK3,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f125]) ).
fof(f149,plain,
duplicatefreeP(sK2),
inference(cnf_transformation,[],[f125]) ).
fof(f150,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f125]) ).
fof(f151,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f125]) ).
fof(f196,plain,
( ~ duplicatefreeP(sK2)
| memberP(sK2,sK4)
| memberP(sK3,sK4) ),
inference(definition_unfolding,[],[f146,f151,f150,f150]) ).
fof(f197,plain,
( ~ duplicatefreeP(sK2)
| ~ memberP(sK2,sK4)
| ~ memberP(sK3,sK4) ),
inference(definition_unfolding,[],[f145,f151,f150,f150]) ).
fof(f198,plain,
( ~ duplicatefreeP(sK2)
| ssItem(sK4) ),
inference(definition_unfolding,[],[f144,f150]) ).
tcf(c_49,negated_conjecture,
duplicatefreeP(sK2),
inference(cnf_transformation,[],[f149]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] :
( memberP(sK3,X0)
| ~ ssItem(X0)
| ~ memberP(sK2,X0) ),
inference(cnf_transformation,[],[f148]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( memberP(sK2,X0)
| ~ ssItem(X0)
| ~ memberP(sK3,X0) ),
inference(cnf_transformation,[],[f147]) ).
tcf(c_52,negated_conjecture,
( memberP(sK3,sK4)
| memberP(sK2,sK4)
| ~ duplicatefreeP(sK2) ),
inference(cnf_transformation,[],[f196]) ).
tcf(c_53,negated_conjecture,
( ~ duplicatefreeP(sK2)
| ~ memberP(sK3,sK4)
| ~ memberP(sK2,sK4) ),
inference(cnf_transformation,[],[f197]) ).
tcf(c_54,negated_conjecture,
( ssItem(sK4)
| ~ duplicatefreeP(sK2) ),
inference(cnf_transformation,[],[f198]) ).
tcf(c_125,negated_conjecture,
ssItem(sK4),
inference(global_subsumption_just,[status(thm)],[c_54,c_49,c_54]) ).
tcf(c_1143,plain,
( memberP(sK3,sK4)
| memberP(sK2,sK4) ),
inference(prop_impl_just,[status(thm)],[c_49,c_52]) ).
tcf(c_3130,plain,
( memberP(sK2,sK4)
| ~ ssItem(sK4) ),
inference(superposition,[status(thm)],[c_1143,c_51]) ).
tcf(c_3132,plain,
memberP(sK2,sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_3130,c_125]) ).
tcf(c_3134,plain,
( memberP(sK3,sK4)
| ~ ssItem(sK4) ),
inference(superposition,[status(thm)],[c_3132,c_50]) ).
tcf(c_3135,plain,
memberP(sK3,sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_3134,c_125]) ).
tcf(c_3136,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3135,c_3132,c_53,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC001+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n011.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 15:51:14 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 3.84/1.19 % SZS status Started for theBenchmark.p
% 3.84/1.19 % SZS status Theorem for theBenchmark.p
% 3.84/1.19
% 3.84/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.84/1.19
% 3.84/1.19 % ------ iProver source info
% 3.84/1.19
% 3.84/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.84/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.84/1.19 % git: non_committed_changes: false
% 3.84/1.19
% 3.84/1.19 % ------ Parsing...
% 3.84/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.84/1.19
% 3.84/1.19 % ------ 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 %
% 3.84/1.19
% 3.84/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.84/1.19
% 3.84/1.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.84/1.19 % ------ Proving...
% 3.84/1.19 % ------ Problem Properties
% 3.84/1.19
% 3.84/1.19 %
% 3.84/1.19 % clauses 52
% 3.84/1.19 % conjectures 6
% 3.84/1.19 % EPR 14
% 3.84/1.19 % Horn 39
% 3.84/1.19 % unary 10
% 3.84/1.19 % binary 6
% 3.84/1.19 % lits 164
% 3.84/1.19 % lits eq 29
% 3.84/1.19 % fd_pure 0
% 3.84/1.19 % fd_pseudo 0
% 3.84/1.19 % fd_cond 4
% 3.84/1.19 % fd_pseudo_cond 5
% 3.84/1.19 % AC symbols 0
% 3.84/1.19
% 3.84/1.19 % ------ Schedule dynamic 5 is on
% 3.84/1.19
% 3.84/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.84/1.19
% 3.84/1.19
% 3.84/1.19 % ------
% 3.84/1.19 % Current options:
% 3.84/1.19 % ------
% 3.84/1.19
% 3.84/1.19
% 3.84/1.19 %
% 3.84/1.19
% 3.84/1.19 % ------ Proving...
% 3.84/1.19 %
% 3.84/1.19
% 3.84/1.19 % SZS status Theorem for theBenchmark.p
% 3.84/1.19
% 3.84/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.84/1.19
% 3.84/1.19
%------------------------------------------------------------------------------