%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC405+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 : n003.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:09:39 PM UTC 2026
% Result : Theorem 3.72s 1.51s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 11 unt; 0 def)
% Number of atoms : 89 ( 12 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 101 ( 31 ~; 24 |; 36 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 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 : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 27 ( 0 sgn 15 !; 12 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X5] :
( ssItem(X5)
=> ( memberP(X1,X5)
| ~ memberP(X0,X5) ) )
| ? [X4] :
( ( ( memberP(X3,X4)
& ~ memberP(X2,X4) )
| ( memberP(X2,X4)
& ~ memberP(X3,X4) ) )
& ssItem(X4) )
| 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)
=> ( ! [X5] :
( ssItem(X5)
=> ( memberP(X1,X5)
| ~ memberP(X0,X5) ) )
| ? [X4] :
( ( ( memberP(X3,X4)
& ~ memberP(X2,X4) )
| ( memberP(X2,X4)
& ~ memberP(X3,X4) ) )
& ssItem(X4) )
| 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)
& ? [X5] :
( ssItem(X5)
& ~ memberP(X1,X5)
& memberP(X0,X5) )
& ! [X4] :
( ( ( ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| memberP(X3,X4) ) )
| ~ ssItem(X4) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X5] :
( ssItem(X5)
& ~ memberP(X1,X5)
& memberP(X0,X5) )
& ! [X4] :
( ( ( ~ memberP(X3,X4)
| memberP(X2,X4) )
& ( ~ memberP(X2,X4)
| memberP(X3,X4) ) )
| ~ ssItem(X4) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f122,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ssItem(sK4)
& ~ memberP(sK1,sK4)
& memberP(sK0,sK4)
& ! [X4] :
( ( ( ~ memberP(sK3,X4)
| memberP(sK2,X4) )
& ( ~ memberP(sK2,X4)
| memberP(sK3,X4) ) )
| ~ ssItem(X4) )
& 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(f138,plain,
ssItem(sK4),
inference(cnf_transformation,[],[f122]) ).
fof(f139,plain,
~ memberP(sK1,sK4),
inference(cnf_transformation,[],[f122]) ).
fof(f140,plain,
memberP(sK0,sK4),
inference(cnf_transformation,[],[f122]) ).
fof(f142,plain,
! [X4] :
( ~ memberP(sK2,X4)
| memberP(sK3,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f122]) ).
fof(f143,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f122]) ).
fof(f144,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f122]) ).
fof(f179,plain,
memberP(sK2,sK4),
inference(definition_unfolding,[],[f140,f143]) ).
fof(f180,plain,
~ memberP(sK3,sK4),
inference(definition_unfolding,[],[f139,f144]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] :
( memberP(sK3,X0)
| ~ ssItem(X0)
| ~ memberP(sK2,X0) ),
inference(cnf_transformation,[],[f142]) ).
tcf(c_51,negated_conjecture,
memberP(sK2,sK4),
inference(cnf_transformation,[],[f179]) ).
tcf(c_52,negated_conjecture,
~ memberP(sK3,sK4),
inference(cnf_transformation,[],[f180]) ).
tcf(c_53,negated_conjecture,
ssItem(sK4),
inference(cnf_transformation,[],[f138]) ).
tcf(c_1755,plain,
( memberP(sK3,sK4)
| ~ ssItem(sK4) ),
inference(superposition,[status(thm)],[c_51,c_49]) ).
tcf(c_1756,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1755,c_52,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC405+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.11/0.59 % Computer : n003.cluster.edu
% 0.11/0.59 % Model : x86_64 x86_64
% 0.11/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.59 % Memory : 8046.5625MB
% 0.11/0.59 % OS : Linux 6.8.0-71-generic
% 0.11/0.59 % CPULimit : 300
% 0.11/0.59 % WCLimit : 300
% 0.11/0.59 % DateTime : Thu Sep 24 18:06:23 UTC 2026
% 0.11/0.60 % CPUTime :
% 0.11/0.60 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.63 Running first-order theorem proving
% 0.11/0.63 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.14/0.64
% 0.14/0.64 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.64
% 0.14/0.64 % Detected problem language: tptp
% 0.14/0.65 % Proving...
% 3.72/1.51 % SZS status Started for theBenchmark.p
% 3.72/1.51 % SZS status Theorem for theBenchmark.p
% 3.72/1.51
% 3.72/1.51 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.72/1.51
% 3.72/1.51 % ------ iProver source info
% 3.72/1.51
% 3.72/1.51 % git: date: 2026-07-19 20:42:38 +0200
% 3.72/1.51 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.72/1.51 % git: non_committed_changes: false
% 3.72/1.51
% 3.72/1.51 % ------ Parsing...
% 3.72/1.51 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.72/1.51
% 3.72/1.51 % ------ 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.72/1.51
% 3.72/1.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.72/1.51
% 3.72/1.51 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.72/1.51 % ------ Proving...
% 3.72/1.51 % ------ Problem Properties
% 3.72/1.51
% 3.72/1.51 %
% 3.72/1.51 % clauses 41
% 3.72/1.51 % conjectures 7
% 3.72/1.51 % EPR 12
% 3.72/1.51 % Horn 36
% 3.72/1.51 % unary 10
% 3.72/1.51 % binary 3
% 3.72/1.51 % lits 131
% 3.72/1.51 % lits eq 27
% 3.72/1.51 % fd_pure 0
% 3.72/1.51 % fd_pseudo 0
% 3.72/1.51 % fd_cond 4
% 3.72/1.51 % fd_pseudo_cond 5
% 3.72/1.51 % AC symbols 0
% 3.72/1.51
% 3.72/1.51 % ------ Schedule dynamic 5 is on
% 3.72/1.51
% 3.72/1.51 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.72/1.51
% 3.72/1.51
% 3.72/1.51 % ------
% 3.72/1.51 % Current options:
% 3.72/1.51 % ------
% 3.72/1.51
% 3.72/1.51
% 3.72/1.51 %
% 3.72/1.51
% 3.72/1.51 % ------ Proving...
% 3.72/1.51 %
% 3.72/1.51
% 3.72/1.51 % SZS status Theorem for theBenchmark.p
% 3.72/1.51
% 3.72/1.51 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.72/1.51
% 3.72/1.51
%------------------------------------------------------------------------------