%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC006+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n009.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:28 PM UTC 2026
% Result : Theorem 4.24s 1.41s
% Output : CNFRefutation 4.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 22 unt; 3 def)
% Number of atoms : 137 ( 50 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 146 ( 59 ~; 47 |; 30 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 37 !; 13 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( app(X7,X9) != X2
| app(app(X7,X8),X9) != X3
| ~ ssList(X9) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( app(X7,X9) != X2
| app(app(X7,X8),X9) != X3
| ~ ssList(X9) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(X7,X9) = X2
& app(app(X7,X8),X9) = X3
& ssList(X9) ) ) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X0
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f295,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK57)
& ssList(sK58)
& sK55 = app(sK57,sK59)
& sK56 = app(app(sK57,sK58),sK59)
& ssList(sK59)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK53
| app(app(X4,X5),X6) != sK54
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X7,sK57),skolemize(X8,sK58),skolemize(X9,sK59)],[f221]) ).
fof(f498,plain,
ssList(sK57),
inference(cnf_transformation,[],[f295]) ).
fof(f499,plain,
ssList(sK58),
inference(cnf_transformation,[],[f295]) ).
fof(f500,plain,
sK55 = app(sK57,sK59),
inference(cnf_transformation,[],[f295]) ).
fof(f501,plain,
sK56 = app(app(sK57,sK58),sK59),
inference(cnf_transformation,[],[f295]) ).
fof(f502,plain,
ssList(sK59),
inference(cnf_transformation,[],[f295]) ).
fof(f503,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK53
| app(app(X4,X5),X6) != sK54
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f295]) ).
fof(f504,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f295]) ).
fof(f505,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f295]) ).
fof(f507,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK55
| app(app(X4,X5),X6) != sK56
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f503,f505,f504]) ).
tcf(c_247,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X2) != sK55 )
| ( app(app(X0,X1),X2) != sK56 ) ),
inference(cnf_transformation,[],[f507]) ).
tcf(c_248,negated_conjecture,
ssList(sK59),
inference(cnf_transformation,[],[f502]) ).
tcf(c_249,negated_conjecture,
app(app(sK57,sK58),sK59) = sK56,
inference(cnf_transformation,[],[f501]) ).
tcf(c_250,negated_conjecture,
app(sK57,sK59) = sK55,
inference(cnf_transformation,[],[f500]) ).
tcf(c_251,negated_conjecture,
ssList(sK58),
inference(cnf_transformation,[],[f499]) ).
tcf(c_252,negated_conjecture,
ssList(sK57),
inference(cnf_transformation,[],[f498]) ).
tcf(c_8830,definition,
iPr_def_10 = app(sK57,sK59),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_8831,definition,
iPr_def_11 = app(sK57,sK58),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_8832,definition,
iPr_def_12 = app(iPr_def_11,sK59),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_8834,negated_conjecture,
ssList(sK57),
inference(demodulation,[status(thm)],[c_252]) ).
tcf(c_8835,negated_conjecture,
ssList(sK58),
inference(demodulation,[status(thm)],[c_251]) ).
tcf(c_8836,negated_conjecture,
iPr_def_10 = sK55,
inference(demodulation,[status(thm)],[c_250,c_8830]) ).
tcf(c_8837,negated_conjecture,
iPr_def_12 = sK56,
inference(demodulation,[status(thm)],[c_249,c_8831,c_8832]) ).
tcf(c_8838,negated_conjecture,
ssList(sK59),
inference(demodulation,[status(thm)],[c_248]) ).
tcf(c_8839,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X2) != sK55 )
| ( app(app(X0,X1),X2) != sK56 ) ),
inference(demodulation,[status(thm)],[c_247]) ).
tcf(c_11674,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X2) != iPr_def_10 )
| ( app(app(X0,X1),X2) != iPr_def_12 ) ),
inference(light_normalisation,[status(thm)],[c_8839,c_8836,c_8837]) ).
tcf(c_11771,plain,
! [X0: $i] :
( ~ ssList(sK58)
| ~ ssList(sK57)
| ~ ssList(X0)
| ( app(iPr_def_11,X0) != iPr_def_12 )
| ( app(sK57,X0) != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_8831,c_11674]) ).
tcf(c_11772,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( app(iPr_def_11,X0) != iPr_def_12 )
| ( app(sK57,X0) != iPr_def_10 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11771,c_8835,c_8834]) ).
tcf(c_11816,plain,
( ~ ssList(sK59)
| ( app(iPr_def_11,sK59) != iPr_def_12 ) ),
inference(superposition,[status(thm)],[c_8830,c_11772]) ).
tcf(c_11817,plain,
~ ssList(sK59),
inference(ground_joinability,[status(thm)],[c_11816,c_8832]) ).
tcf(c_11818,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11817,c_8838]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC006+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.44 % Computer : n009.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Thu Sep 24 15:52:30 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.50 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.26/0.51
% 0.26/0.51 % ======== iProver multi-core TPTP/SMT =========
% 0.26/0.51
% 0.26/0.51 % Detected problem language: tptp
% 0.26/0.53 % Proving...
% 4.24/1.41 % SZS status Started for theBenchmark.p
% 4.24/1.41 % SZS status Theorem for theBenchmark.p
% 4.24/1.41
% 4.24/1.41 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.24/1.41
% 4.24/1.41 % ------ iProver source info
% 4.24/1.41
% 4.24/1.41 % git: date: 2026-07-19 20:42:38 +0200
% 4.24/1.41 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.24/1.41 % git: non_committed_changes: false
% 4.24/1.41
% 4.24/1.41 % ------ Parsing...
% 4.24/1.41 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.24/1.41
% 4.24/1.41 % ------ 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 %
% 4.24/1.41
% 4.24/1.41 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.24/1.41
% 4.24/1.41 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.24/1.41 % ------ Proving...
% 4.24/1.41 % ------ Problem Properties
% 4.24/1.41
% 4.24/1.41 %
% 4.24/1.41 % clauses 191
% 4.24/1.41 % conjectures 8
% 4.24/1.41 % EPR 56
% 4.24/1.41 % Horn 123
% 4.24/1.41 % unary 26
% 4.24/1.41 % binary 40
% 4.24/1.41 % lits 633
% 4.24/1.41 % lits eq 85
% 4.24/1.41 % fd_pure 0
% 4.24/1.41 % fd_pseudo 0
% 4.24/1.41 % fd_cond 21
% 4.24/1.41 % fd_pseudo_cond 14
% 4.24/1.41 % AC symbols 0
% 4.24/1.41
% 4.24/1.41 % ------ Schedule dynamic 5 is on
% 4.24/1.41
% 4.24/1.41 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.24/1.41
% 4.24/1.41
% 4.24/1.41 % ------
% 4.24/1.41 % Current options:
% 4.24/1.41 % ------
% 4.24/1.41
% 4.24/1.41
% 4.24/1.41 %
% 4.24/1.41
% 4.24/1.41 % ------ Proving...
% 4.24/1.41 %
% 4.24/1.41
% 4.24/1.41 % SZS status Theorem for theBenchmark.p
% 4.24/1.41
% 4.24/1.41 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.24/1.41
% 4.24/1.41
%------------------------------------------------------------------------------