%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC030-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 : 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:35 PM UTC 2026
% Result : Unsatisfiable 3.77s 1.19s
% Output : CNFRefutation 3.77s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f250ERROR: Could not build tree for root c_16682ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f73,axiom,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
fof(f82,axiom,
! [X0] :
( nil = X0
| ~ ssList(X0)
| ~ rearsegP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause82) ).
fof(f84,axiom,
! [X0] :
( nil = X0
| ~ ssList(X0)
| ~ frontsegP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause84) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f121,axiom,
! [X0,X1] :
( nil = X0
| ~ ssList(X0)
| ~ ssList(X1)
| app(X0,X1) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
fof(f122,plain,
! [X0,X1] :
( nil = X0
| ~ ssList(X0)
| ~ ssList(X1)
| nil != app(X0,X1) ),
inference(reorient_equations,[],[f121]) ).
fof(f123,axiom,
! [X0,X1] :
( nil = X1
| ~ ssList(X0)
| ~ ssList(X1)
| app(X0,X1) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
fof(f124,plain,
! [X0,X1] :
( nil = X1
| ~ ssList(X0)
| ~ ssList(X1)
| nil != app(X0,X1) ),
inference(reorient_equations,[],[f123]) ).
fof(f154,axiom,
! [X2,X0,X1] :
( rearsegP(X2,X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| app(X0,X1) != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause143) ).
fof(f155,axiom,
! [X2,X0,X1] :
( frontsegP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X0,X1) != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
app(sk5,sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,plain,
sk4 = app(sk5,sk6),
inference(reorient_equations,[],[f208]) ).
fof(f210,negated_conjecture,
app(sk6,sk5) = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f211,plain,
sk3 = app(sk6,sk5),
inference(reorient_equations,[],[f210]) ).
fof(f212,negated_conjecture,
( nil = sk1
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f215,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f218,plain,
( nil = sk3
| nil = sk4 ),
inference(definition_unfolding,[],[f212,f204,f205]) ).
fof(f221,plain,
( nil != sk4
| nil != sk3 ),
inference(definition_unfolding,[],[f215,f205,f204]) ).
fof(f232,plain,
! [X0,X1] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(equality_resolution,[],[f154]) ).
fof(f233,plain,
! [X0,X1] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f155]) ).
tcf(c_255,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_320,plain,
! [X0: $i] :
( ( app(X0,nil) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f73]) ).
tcf(c_329,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ rearsegP(nil,X0) ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_331,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ frontsegP(nil,X0) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_332,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_365,plain,
! [X0: $i,X1: $i] :
( ( X0 = nil )
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f122]) ).
tcf(c_366,plain,
! [X0: $i,X1: $i] :
( ( X1 = nil )
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f124]) ).
tcf(c_390,plain,
! [X0: $i,X1: $i] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f232]) ).
tcf(c_391,plain,
! [X0: $i,X1: $i] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f233]) ).
tcf(c_392,plain,
( ( app(nil,nil) = nil )
| ~ ssList(nil) ),
inference(cnf_transformation,[],[f250]) ).
tcf(c_437,negated_conjecture,
ssList(sk5),
inference(cnf_transformation,[],[f206]) ).
tcf(c_438,negated_conjecture,
ssList(sk6),
inference(cnf_transformation,[],[f207]) ).
tcf(c_439,negated_conjecture,
app(sk5,sk6) = sk4,
inference(cnf_transformation,[],[f209]) ).
tcf(c_440,negated_conjecture,
app(sk6,sk5) = sk3,
inference(cnf_transformation,[],[f211]) ).
tcf(c_441,negated_conjecture,
( ( sk4 = nil )
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f218]) ).
tcf(c_442,negated_conjecture,
( ( sk4 != nil )
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_556,plain,
app(nil,nil) = nil,
inference(global_subsumption_just,[status(thm)],[c_392,c_255,c_392]) ).
tcf(c_1140,plain,
! [X0: $i,X1: $i] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_390,c_332]) ).
tcf(c_1141,plain,
! [X0: $i,X1: $i] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_391,c_332]) ).
tcf(c_7123,definition,
iPr_def_12 = app(sk6,sk5),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_7124,definition,
iPr_def_13 = app(sk5,sk6),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_7125,negated_conjecture,
( ( sk4 != nil )
| ( sk3 != nil ) ),
inference(demodulation,[status(thm)],[c_442]) ).
tcf(c_7126,negated_conjecture,
( ( sk4 = nil )
| ( sk3 = nil ) ),
inference(demodulation,[status(thm)],[c_441]) ).
tcf(c_7127,negated_conjecture,
iPr_def_12 = sk3,
inference(demodulation,[status(thm)],[c_440,c_7123]) ).
tcf(c_7128,negated_conjecture,
iPr_def_13 = sk4,
inference(demodulation,[status(thm)],[c_439,c_7124]) ).
tcf(c_7129,negated_conjecture,
ssList(sk6),
inference(demodulation,[status(thm)],[c_438]) ).
tcf(c_7130,negated_conjecture,
ssList(sk5),
inference(demodulation,[status(thm)],[c_437]) ).
tcf(c_10382,plain,
( ( nil = iPr_def_13 )
| ( nil = iPr_def_12 ) ),
inference(light_normalisation,[status(thm)],[c_7126,c_7127,c_7128]) ).
tcf(c_10385,plain,
( ( nil != iPr_def_13 )
| ( nil != iPr_def_12 ) ),
inference(light_normalisation,[status(thm)],[c_7125,c_7127,c_7128]) ).
tcf(c_10568,plain,
app(sk5,nil) = sk5,
inference(superposition,[status(thm)],[c_7130,c_320]) ).
tcf(c_11234,plain,
! [X0: $i] :
( ( nil = iPr_def_12 )
| ( X0 = nil )
| ~ ssList(X0)
| ~ rearsegP(iPr_def_13,X0) ),
inference(superposition,[status(thm)],[c_10382,c_329]) ).
tcf(c_11249,plain,
! [X0: $i] :
( ( nil = iPr_def_12 )
| ( X0 = nil )
| ~ ssList(X0)
| ~ frontsegP(iPr_def_13,X0) ),
inference(superposition,[status(thm)],[c_10382,c_331]) ).
tcf(c_11434,plain,
( rearsegP(iPr_def_13,sk6)
| ~ ssList(sk6)
| ~ ssList(sk5) ),
inference(superposition,[status(thm)],[c_7124,c_1140]) ).
tcf(c_11480,plain,
rearsegP(iPr_def_13,sk6),
inference(forward_subsumption_resolution,[status(thm)],[c_11434,c_7129,c_7130]) ).
tcf(c_11558,plain,
( frontsegP(iPr_def_13,sk5)
| ~ ssList(sk6)
| ~ ssList(sk5) ),
inference(superposition,[status(thm)],[c_7124,c_1141]) ).
tcf(c_11604,plain,
frontsegP(iPr_def_13,sk5),
inference(forward_subsumption_resolution,[status(thm)],[c_11558,c_7129,c_7130]) ).
tcf(c_11666,plain,
( ( nil = iPr_def_12 )
| ( sk6 = nil )
| ~ ssList(sk6) ),
inference(superposition,[status(thm)],[c_11480,c_11234]) ).
tcf(c_11667,plain,
( ( nil = iPr_def_12 )
| ( sk6 = nil ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11666,c_7129]) ).
tcf(c_12072,plain,
( ( nil = iPr_def_12 )
| ( sk5 = nil )
| ~ ssList(sk5) ),
inference(superposition,[status(thm)],[c_11604,c_11249]) ).
tcf(c_12073,plain,
( ( nil = iPr_def_12 )
| ( sk5 = nil ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12072,c_7130]) ).
tcf(c_13414,plain,
( ( sk5 = nil )
| ~ ssList(sk6)
| ~ ssList(sk5)
| ( nil != iPr_def_13 ) ),
inference(superposition,[status(thm)],[c_7124,c_365]) ).
tcf(c_13415,plain,
( ( sk6 = nil )
| ~ ssList(sk6)
| ~ ssList(sk5)
| ( nil != iPr_def_12 ) ),
inference(superposition,[status(thm)],[c_7123,c_365]) ).
tcf(c_13456,plain,
( ( sk6 = nil )
| ( nil != iPr_def_12 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13415,c_7129,c_7130]) ).
tcf(c_13459,plain,
( ( sk5 = nil )
| ( nil != iPr_def_13 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13414,c_7129,c_7130]) ).
tcf(c_13471,plain,
( ( sk5 = nil )
| ~ ssList(sk6)
| ~ ssList(sk5)
| ( nil != iPr_def_12 ) ),
inference(superposition,[status(thm)],[c_7123,c_366]) ).
tcf(c_13512,plain,
( ( sk5 = nil )
| ( nil != iPr_def_12 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13471,c_7129,c_7130]) ).
tcf(c_13615,plain,
sk6 = nil,
inference(global_subsumption_just,[status(thm)],[c_13456,c_11667,c_13456]) ).
tcf(c_13639,plain,
app(sk5,nil) = iPr_def_13,
inference(demodulation,[status(thm)],[c_7124,c_13615]) ).
tcf(c_13640,plain,
app(nil,sk5) = iPr_def_12,
inference(demodulation,[status(thm)],[c_7123,c_13615]) ).
tcf(c_13642,plain,
sk5 = iPr_def_13,
inference(demodulation,[status(thm)],[c_10568,c_13639]) ).
tcf(c_13666,plain,
sk5 = nil,
inference(global_subsumption_just,[status(thm)],[c_13459,c_12073,c_13512]) ).
tcf(c_13668,plain,
nil = iPr_def_13,
inference(light_normalisation,[status(thm)],[c_13666,c_13642]) ).
tcf(c_13786,plain,
app(iPr_def_13,iPr_def_13) = iPr_def_13,
inference(demodulation,[status(thm)],[c_556,c_13668]) ).
tcf(c_13787,plain,
( ( iPr_def_13 != iPr_def_13 )
| ( iPr_def_12 != iPr_def_13 ) ),
inference(demodulation,[status(thm)],[c_10385,c_13668]) ).
tcf(c_13815,plain,
iPr_def_12 != iPr_def_13,
inference(equality_resolution_simp,[status(thm)],[c_13787]) ).
tcf(c_14144,plain,
iPr_def_12 = iPr_def_13,
inference(light_normalisation,[status(thm)],[c_13640,c_13642,c_13668,c_13786]) ).
tcf(c_16682,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_14144,c_13815]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC030-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.39 % Computer : n009.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Thu Sep 24 16:00:28 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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.11/0.44
% 0.11/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.44
% 0.11/0.44 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 3.77/1.19 % SZS status Started for theBenchmark.p
% 3.77/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.77/1.19
% 3.77/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.77/1.19
% 3.77/1.19 % ------ iProver source info
% 3.77/1.19
% 3.77/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.77/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.77/1.19 % git: non_committed_changes: false
% 3.77/1.19
% 3.77/1.19 % ------ Parsing...% successful
% 3.77/1.19
% 3.77/1.19
% 3.77/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.77/1.19
% 3.77/1.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.77/1.19
% 3.77/1.19 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.77/1.19
% 3.77/1.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.77/1.19 % ------ Proving...
% 3.77/1.19 % ------ Problem Properties
% 3.77/1.19
% 3.77/1.19 %
% 3.77/1.19 % clauses 187
% 3.77/1.19 % conjectures 8
% 3.77/1.19 % EPR 60
% 3.77/1.19 % Horn 158
% 3.77/1.19 % unary 66
% 3.77/1.19 % binary 23
% 3.77/1.19 % lits 553
% 3.77/1.19 % lits eq 77
% 3.77/1.19 % fd_pure 0
% 3.77/1.19 % fd_pseudo 0
% 3.77/1.19 % fd_cond 15
% 3.77/1.19 % fd_pseudo_cond 14
% 3.77/1.19 % AC symbols 0
% 3.77/1.19
% 3.77/1.19 % ------ Schedule dynamic 5 is on
% 3.77/1.19
% 3.77/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.77/1.19
% 3.77/1.19
% 3.77/1.19 % ------
% 3.77/1.19 % Current options:
% 3.77/1.19 % ------
% 3.77/1.19
% 3.77/1.19
% 3.77/1.19 %
% 3.77/1.19
% 3.77/1.19 % ------ Proving...
% 3.77/1.19 %
% 3.77/1.19
% 3.77/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.77/1.19
% 3.77/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.77/1.20
% 3.77/1.20
%------------------------------------------------------------------------------