%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC043+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 : n014.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:39 PM UTC 2026
% Result : Theorem 3.90s 1.30s
% Output : CNFRefutation 3.90s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f605ERROR: Could not build tree for root c_12469ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f200,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
inference(ennf_transformation,[],[f83]) ).
fof(f201,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3 )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3 )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f292,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil != app(X0,X1)
| ( nil = X0
& nil = X1 ) )
& ( nil != X0
| nil != X1
| nil = app(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f200]) ).
fof(f293,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil != app(X0,X1)
| ( nil = X0
& nil = X1 ) )
& ( nil != X0
| nil != X1
| nil = app(X0,X1) ) ) ) ),
inference(flattening,[],[f292]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( nil != sK55
| nil = sK56 )
& ssList(sK57)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK55
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK57
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK55)
& sK56 = app(sK55,sK57)
& nil != sK53
& sK53 = sK55
& sK54 = sK56
& nil = sK54 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57)],[f222]) ).
fof(f479,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil != app(X0,X1)
| nil = X0 ),
inference(cnf_transformation,[],[f293]) ).
fof(f482,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f497,plain,
ssList(sK54),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
ssList(sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
sK56 = app(sK55,sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
nil != sK53,
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
nil = sK54,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
nil = sK56,
inference(definition_unfolding,[],[f508,f507]) ).
fof(f564,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(X0,X1) != sK56
| sK56 = X0 ),
inference(definition_unfolding,[],[f479,f509,f509]) ).
fof(f565,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,sK56) = X0 ),
inference(definition_unfolding,[],[f482,f509]) ).
fof(f568,plain,
sK55 != sK56,
inference(definition_unfolding,[],[f505,f509,f506]) ).
fof(f571,plain,
ssList(sK56),
inference(definition_unfolding,[],[f497,f507]) ).
fof(f572,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f506]) ).
tcf(c_229,negated_conjecture,
( ( app(sK56,sK56) = sK56 )
| ~ ssList(sK56) ),
inference(cnf_transformation,[],[f605]) ).
tcf(c_231,negated_conjecture,
! [X0: $i,X1: $i] :
( ( X0 = sK56 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != sK56 ) ),
inference(cnf_transformation,[],[f564]) ).
tcf(c_232,negated_conjecture,
! [X0: $i] :
( ( app(X0,sK56) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f565]) ).
tcf(c_246,negated_conjecture,
sK56 != sK55,
inference(cnf_transformation,[],[f568]) ).
tcf(c_247,negated_conjecture,
app(sK55,sK57) = sK56,
inference(cnf_transformation,[],[f504]) ).
tcf(c_250,negated_conjecture,
ssList(sK57),
inference(cnf_transformation,[],[f501]) ).
tcf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f571]) ).
tcf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f572]) ).
tcf(c_295,plain,
( ( app(sK56,sK56) = sK56 )
| ~ ssList(sK56) ),
inference(instantiation,[status(thm)],[c_232]) ).
tcf(c_367,negated_conjecture,
app(sK56,sK56) = sK56,
inference(global_subsumption_just,[status(thm)],[c_229,c_253,c_295]) ).
tcf(c_8836,definition,
iPr_def_10 = app(sK56,sK56),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_8837,definition,
iPr_def_11 = app(sK55,sK57),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_8844,negated_conjecture,
iPr_def_10 = sK56,
inference(demodulation,[status(thm)],[c_367,c_8836]) ).
tcf(c_8848,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_254]) ).
tcf(c_8849,negated_conjecture,
ssList(sK57),
inference(demodulation,[status(thm)],[c_250]) ).
tcf(c_8852,negated_conjecture,
iPr_def_11 = sK56,
inference(demodulation,[status(thm)],[c_247,c_8837]) ).
tcf(c_8853,negated_conjecture,
sK56 != sK55,
inference(demodulation,[status(thm)],[c_246]) ).
tcf(c_8857,negated_conjecture,
! [X0: $i,X1: $i] :
( ( X0 = sK56 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != sK56 ) ),
inference(demodulation,[status(thm)],[c_231]) ).
tcf(c_11738,plain,
iPr_def_10 = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_8852,c_8844]) ).
tcf(c_11739,plain,
sK55 != iPr_def_10,
inference(light_normalisation,[status(thm)],[c_8853,c_8844]) ).
tcf(c_11764,plain,
app(sK55,sK57) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_8837,c_11738]) ).
tcf(c_12450,plain,
! [X0: $i,X1: $i] :
( ( X0 = iPr_def_10 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_8857,c_8844]) ).
tcf(c_12463,plain,
( ( sK55 = iPr_def_10 )
| ~ ssList(sK57)
| ~ ssList(sK55) ),
inference(superposition,[status(thm)],[c_11764,c_12450]) ).
tcf(c_12469,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12463,c_11739,c_8849,c_8848]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC043+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.02/0.37 % Computer : n014.cluster.edu
% 0.02/0.37 % Model : x86_64 x86_64
% 0.02/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.37 % Memory : 8046.5625MB
% 0.02/0.37 % OS : Linux 6.8.0-71-generic
% 0.02/0.37 % CPULimit : 300
% 0.02/0.37 % WCLimit : 300
% 0.02/0.37 % DateTime : Thu Sep 24 16:04:05 UTC 2026
% 0.02/0.37 % CPUTime :
% 0.02/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/0.41 Running first-order theorem proving
% 0.02/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.02/0.42
% 0.02/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.02/0.42
% 0.02/0.42 % Detected problem language: tptp
% 0.02/0.44 % Proving...
% 3.90/1.30 % SZS status Started for theBenchmark.p
% 3.90/1.30 % SZS status Theorem for theBenchmark.p
% 3.90/1.30
% 3.90/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.90/1.30
% 3.90/1.30 % ------ iProver source info
% 3.90/1.30
% 3.90/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 3.90/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.90/1.30 % git: non_committed_changes: false
% 3.90/1.30
% 3.90/1.30 % ------ Parsing...
% 3.90/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.90/1.30
% 3.90/1.30 % ------ 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.90/1.30
% 3.90/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.90/1.30
% 3.90/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.90/1.30 % ------ Proving...
% 3.90/1.30 % ------ Problem Properties
% 3.90/1.30
% 3.90/1.30 %
% 3.90/1.30 % clauses 188
% 3.90/1.30 % conjectures 54
% 3.90/1.30 % EPR 55
% 3.90/1.30 % Horn 120
% 3.90/1.30 % unary 23
% 3.90/1.30 % binary 40
% 3.90/1.30 % lits 632
% 3.90/1.30 % lits eq 84
% 3.90/1.30 % fd_pure 0
% 3.90/1.30 % fd_pseudo 0
% 3.90/1.30 % fd_cond 21
% 3.90/1.30 % fd_pseudo_cond 14
% 3.90/1.30 % AC symbols 0
% 3.90/1.30
% 3.90/1.30 % ------ Schedule dynamic 5 is on
% 3.90/1.30
% 3.90/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.90/1.30
% 3.90/1.30
% 3.90/1.30 % ------
% 3.90/1.30 % Current options:
% 3.90/1.30 % ------
% 3.90/1.30
% 3.90/1.30
% 3.90/1.30 %
% 3.90/1.30
% 3.90/1.30 % ------ Proving...
% 3.90/1.30 %
% 3.90/1.30
% 3.90/1.30 % SZS status Theorem for theBenchmark.p
% 3.90/1.30
% 3.90/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.90/1.30
% 3.90/1.30
%------------------------------------------------------------------------------