%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC406+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.69s 1.27s
% Output : CNFRefutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 24 ( 14 unt; 0 def)
% Number of atoms : 157 ( 26 equ)
% Maximal formula atoms : 22 ( 6 avg)
% Number of connectives : 194 ( 61 ~; 52 |; 63 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 45 ( 0 sgn 27 !; 18 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X6] :
( ssItem(X6)
=> ( memberP(X1,X6)
| ~ memberP(X0,X6) ) )
| ? [X4] :
( ( ( ( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(X3,X5) ) )
& ~ memberP(X2,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)
=> ( ! [X6] :
( ssItem(X6)
=> ( memberP(X1,X6)
| ~ memberP(X0,X6) ) )
| ? [X4] :
( ( ( ( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(X3,X5) ) )
& ~ memberP(X2,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)
=> ( ! [X7] :
( ssItem(X7)
=> ( memberP(X1,X7)
| ~ memberP(X0,X7) ) )
| ? [X4] :
( ( ( ( ? [X6] :
( leq(X6,X4)
& memberP(X3,X6)
& X4 != X6
& ssItem(X6) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(X3,X5) ) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X7] :
( ssItem(X7)
& ~ memberP(X1,X7)
& memberP(X0,X7) )
& ! [X4] :
( ( ( ( ! [X6] :
( ~ leq(X6,X4)
| ~ memberP(X3,X6)
| X4 = X6
| ~ ssItem(X6) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& leq(X5,X4)
& memberP(X3,X5) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X7] :
( ssItem(X7)
& ~ memberP(X1,X7)
& memberP(X0,X7) )
& ! [X4] :
( ( ( ( ! [X6] :
( ~ leq(X6,X4)
| ~ memberP(X3,X6)
| X4 = X6
| ~ ssItem(X6) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& leq(X5,X4)
& memberP(X3,X5) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f222]) ).
fof(f297,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ssItem(sK58)
& ~ memberP(sK54,sK58)
& memberP(sK53,sK58)
& ! [X4] :
( ( ( ( ! [X6] :
( ~ leq(X6,X4)
| ~ memberP(sK56,X6)
| X4 = X6
| ~ ssItem(X6) )
& memberP(sK56,X4) )
| ~ memberP(sK55,X4) )
& ( ~ memberP(sK56,X4)
| ( ssItem(sK57(X4))
& sK57(X4) != X4
& leq(sK57(X4),X4)
& memberP(sK56,sK57(X4)) )
| memberP(sK55,X4) ) )
| ~ ssItem(X4) )
& sK53 = sK55
& sK54 = sK56 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X5,sK57(X4)),skolemize(X7,sK58)],[f223]) ).
fof(f501,plain,
ssItem(sK58),
inference(cnf_transformation,[],[f297]) ).
fof(f502,plain,
~ memberP(sK54,sK58),
inference(cnf_transformation,[],[f297]) ).
fof(f503,plain,
memberP(sK53,sK58),
inference(cnf_transformation,[],[f297]) ).
fof(f505,plain,
! [X4] :
( memberP(sK56,X4)
| ~ memberP(sK55,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f297]) ).
fof(f510,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f297]) ).
fof(f511,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f297]) ).
fof(f512,plain,
memberP(sK55,sK58),
inference(definition_unfolding,[],[f503,f510]) ).
fof(f513,plain,
~ memberP(sK56,sK58),
inference(definition_unfolding,[],[f502,f511]) ).
tcf(c_250,negated_conjecture,
! [X0: $i] :
( memberP(sK56,X0)
| ~ ssItem(X0)
| ~ memberP(sK55,X0) ),
inference(cnf_transformation,[],[f505]) ).
tcf(c_252,negated_conjecture,
memberP(sK55,sK58),
inference(cnf_transformation,[],[f512]) ).
tcf(c_253,negated_conjecture,
~ memberP(sK56,sK58),
inference(cnf_transformation,[],[f513]) ).
tcf(c_254,negated_conjecture,
ssItem(sK58),
inference(cnf_transformation,[],[f501]) ).
tcf(c_8992,negated_conjecture,
ssItem(sK58),
inference(demodulation,[status(thm)],[c_254]) ).
tcf(c_8993,negated_conjecture,
~ memberP(sK56,sK58),
inference(demodulation,[status(thm)],[c_253]) ).
tcf(c_8994,negated_conjecture,
memberP(sK55,sK58),
inference(demodulation,[status(thm)],[c_252]) ).
tcf(c_8996,negated_conjecture,
! [X0: $i] :
( memberP(sK56,X0)
| ~ ssItem(X0)
| ~ memberP(sK55,X0) ),
inference(demodulation,[status(thm)],[c_250]) ).
tcf(c_11899,plain,
( memberP(sK56,sK58)
| ~ ssItem(sK58) ),
inference(superposition,[status(thm)],[c_8994,c_8996]) ).
tcf(c_11900,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11899,c_8993,c_8992]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC406+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.10/0.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.04/0.36 % CPULimit : 300
% 0.04/0.36 % WCLimit : 300
% 0.04/0.36 % DateTime : Thu Sep 24 18:06:36 UTC 2026
% 0.04/0.36 % CPUTime :
% 0.04/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.40 Running first-order theorem proving
% 0.04/0.40 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.04/0.41
% 0.04/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.04/0.41
% 0.04/0.41 % Detected problem language: tptp
% 0.04/0.42 % Proving...
% 3.69/1.27 % SZS status Started for theBenchmark.p
% 3.69/1.27 % SZS status Theorem for theBenchmark.p
% 3.69/1.27
% 3.69/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.69/1.27
% 3.69/1.27 % ------ iProver source info
% 3.69/1.27
% 3.69/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 3.69/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.69/1.27 % git: non_committed_changes: false
% 3.69/1.27
% 3.69/1.27 % ------ Parsing...
% 3.69/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.69/1.27
% 3.69/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 3.69/1.27
% 3.69/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.69/1.27
% 3.69/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.69/1.27 % ------ Proving...
% 3.69/1.27 % ------ Problem Properties
% 3.69/1.27
% 3.69/1.27 %
% 3.69/1.27 % clauses 191
% 3.69/1.27 % conjectures 11
% 3.69/1.27 % EPR 56
% 3.69/1.27 % Horn 120
% 3.69/1.27 % unary 21
% 3.69/1.27 % binary 40
% 3.69/1.27 % lits 648
% 3.69/1.27 % lits eq 80
% 3.69/1.27 % fd_pure 0
% 3.69/1.27 % fd_pseudo 0
% 3.69/1.27 % fd_cond 21
% 3.69/1.27 % fd_pseudo_cond 15
% 3.69/1.27 % AC symbols 0
% 3.69/1.27
% 3.69/1.27 % ------ Schedule dynamic 5 is on
% 3.69/1.27
% 3.69/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.69/1.27
% 3.69/1.27
% 3.69/1.27 % ------
% 3.69/1.27 % Current options:
% 3.69/1.27 % ------
% 3.69/1.27
% 3.69/1.27
% 3.69/1.27 %
% 3.69/1.27
% 3.69/1.27 % ------ Proving...
% 3.69/1.27 %
% 3.69/1.27
% 3.69/1.27 % SZS status Theorem for theBenchmark.p
% 3.69/1.27
% 3.69/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.69/1.27
% 3.69/1.27
%------------------------------------------------------------------------------