%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC331+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:09:20 PM UTC 2026
% Result : Theorem 4.33s 1.31s
% Output : CNFRefutation 4.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 45 ( 20 unt; 0 def)
% Number of atoms : 201 ( 53 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 248 ( 92 ~; 83 |; 58 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 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 : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn 52 !; 24 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| 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)
& ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3 )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3 )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f116,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f127,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f131,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) )
& ( nil != sK2
| nil = sK3 )
& ssList(sK4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != sK4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK2)
& sK3 = app(sK2,sK4)
& 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(X4,sK4)],[f99]) ).
fof(f137,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f127]) ).
fof(f138,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(rectify,[],[f137]) ).
fof(f139,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
& ssList(sK10(X0,X1))
& ssList(sK9(X0,X1)) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10]),skolemize(X4,sK9(X0,X1)),skolemize(X5,sK10(X0,X1))],[f138]) ).
fof(f143,plain,
ssList(sK0),
inference(cnf_transformation,[],[f131]) ).
fof(f144,plain,
ssList(sK1),
inference(cnf_transformation,[],[f131]) ).
fof(f147,plain,
( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f149,plain,
ssList(sK4),
inference(cnf_transformation,[],[f131]) ).
fof(f151,plain,
equalelemsP(sK2),
inference(cnf_transformation,[],[f131]) ).
fof(f152,plain,
sK3 = app(sK2,sK4),
inference(cnf_transformation,[],[f131]) ).
fof(f153,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f131]) ).
fof(f154,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f131]) ).
fof(f175,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f116]) ).
fof(f177,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f188,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1) ),
inference(cnf_transformation,[],[f139]) ).
fof(f198,plain,
( ~ equalelemsP(sK2)
| ~ segmentP(sK3,sK2) ),
inference(definition_unfolding,[],[f147,f154,f153,f153]) ).
fof(f199,plain,
ssList(sK3),
inference(definition_unfolding,[],[f144,f154]) ).
fof(f200,plain,
ssList(sK2),
inference(definition_unfolding,[],[f143,f153]) ).
fof(f204,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f188]) ).
tcf(c_49,negated_conjecture,
app(sK2,sK4) = sK3,
inference(cnf_transformation,[],[f152]) ).
tcf(c_50,negated_conjecture,
equalelemsP(sK2),
inference(cnf_transformation,[],[f151]) ).
tcf(c_52,negated_conjecture,
ssList(sK4),
inference(cnf_transformation,[],[f149]) ).
tcf(c_54,negated_conjecture,
( ~ equalelemsP(sK2)
| ~ segmentP(sK3,sK2) ),
inference(cnf_transformation,[],[f198]) ).
tcf(c_57,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f199]) ).
tcf(c_58,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f200]) ).
tcf(c_79,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f175]) ).
tcf(c_81,plain,
ssList(nil),
inference(cnf_transformation,[],[f177]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i,X2: $i] :
( segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(app(X0,X1),X2)) ),
inference(cnf_transformation,[],[f204]) ).
tcf(c_127,negated_conjecture,
~ segmentP(sK3,sK2),
inference(global_subsumption_just,[status(thm)],[c_54,c_50,c_54]) ).
tcf(c_2669,plain,
app(nil,sK2) = sK2,
inference(superposition,[status(thm)],[c_58,c_79]) ).
tcf(c_4389,plain,
! [X0: $i] :
( segmentP(app(sK2,X0),sK2)
| ~ ssList(nil)
| ~ ssList(sK2)
| ~ ssList(X0)
| ~ ssList(app(app(nil,sK2),X0)) ),
inference(superposition,[status(thm)],[c_2669,c_89]) ).
tcf(c_4403,plain,
! [X0: $i] :
( segmentP(app(sK2,X0),sK2)
| ~ ssList(nil)
| ~ ssList(sK2)
| ~ ssList(X0)
| ~ ssList(app(sK2,X0)) ),
inference(light_normalisation,[status(thm)],[c_4389,c_2669]) ).
tcf(c_4404,plain,
! [X0: $i] :
( segmentP(app(sK2,X0),sK2)
| ~ ssList(X0)
| ~ ssList(app(sK2,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4403,c_81,c_58]) ).
tcf(c_4762,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK4)
| ~ ssList(app(sK2,sK4)) ),
inference(superposition,[status(thm)],[c_49,c_4404]) ).
tcf(c_4769,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK4)
| ~ ssList(sK3) ),
inference(light_normalisation,[status(thm)],[c_4762,c_49]) ).
tcf(c_4770,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4769,c_127,c_52,c_57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC331+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 17:39:59 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 4.33/1.31 % SZS status Started for theBenchmark.p
% 4.33/1.31 % SZS status Theorem for theBenchmark.p
% 4.33/1.31
% 4.33/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.33/1.31
% 4.33/1.31 % ------ iProver source info
% 4.33/1.31
% 4.33/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 4.33/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.33/1.31 % git: non_committed_changes: false
% 4.33/1.31
% 4.33/1.31 % ------ Parsing...
% 4.33/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.33/1.31
% 4.33/1.31 % ------ 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 %
% 4.33/1.31
% 4.33/1.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.33/1.31
% 4.33/1.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.33/1.31 % ------ Proving...
% 4.33/1.31 % ------ Problem Properties
% 4.33/1.31
% 4.33/1.31 %
% 4.33/1.31 % clauses 51
% 4.33/1.31 % conjectures 8
% 4.33/1.31 % EPR 17
% 4.33/1.31 % Horn 43
% 4.33/1.31 % unary 13
% 4.33/1.31 % binary 6
% 4.33/1.31 % lits 154
% 4.33/1.31 % lits eq 36
% 4.33/1.31 % fd_pure 0
% 4.33/1.31 % fd_pseudo 0
% 4.33/1.31 % fd_cond 5
% 4.33/1.31 % fd_pseudo_cond 6
% 4.33/1.31 % AC symbols 0
% 4.33/1.31
% 4.33/1.31 % ------ Schedule dynamic 5 is on
% 4.33/1.31
% 4.33/1.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.33/1.31
% 4.33/1.31
% 4.33/1.31 % ------
% 4.33/1.31 % Current options:
% 4.33/1.31 % ------
% 4.33/1.31
% 4.33/1.31
% 4.33/1.31 %
% 4.33/1.31
% 4.33/1.31 % ------ Proving...
% 4.33/1.31 %
% 4.33/1.31
% 4.33/1.31 % SZS status Theorem for theBenchmark.p
% 4.33/1.31
% 4.33/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.33/1.31
% 4.33/1.31
%------------------------------------------------------------------------------