%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC044+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 : n011.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.56s 1.27s
% Output : CNFRefutation 3.56s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f599ERROR: Could not build tree for root c_11933ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f52,axiom,
! [X0] :
( ssList(X0)
=> ( rearsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax52) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil = X0
| ~ rearsegP(X3,X2)
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil = X0
| ~ rearsegP(X3,X2)
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f167,plain,
! [X0] :
( ~ ssList(X0)
| ( rearsegP(nil,X0)
<=> nil = X0 ) ),
inference(ennf_transformation,[],[f52]) ).
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 != X0
& rearsegP(X3,X2)
& 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 != X0
& rearsegP(X3,X2)
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f284,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ rearsegP(nil,X0)
| nil = X0 )
& ( nil != X0
| rearsegP(nil,X0) ) ) ),
inference(nnf_transformation,[],[f167]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& nil != sK53
& rearsegP(sK56,sK55)
& sK53 = sK55
& sK54 = sK56
& nil = sK54 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f436,plain,
! [X0] :
( ~ ssList(X0)
| ~ rearsegP(nil,X0)
| nil = X0 ),
inference(cnf_transformation,[],[f284]) ).
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(f500,plain,
nil != sK53,
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
rearsegP(sK56,sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
nil = sK54,
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
nil = sK56,
inference(definition_unfolding,[],[f504,f503]) ).
fof(f523,plain,
! [X0] :
( ~ ssList(X0)
| ~ rearsegP(sK56,X0)
| sK56 = X0 ),
inference(definition_unfolding,[],[f436,f505,f505]) ).
fof(f561,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,sK56) = X0 ),
inference(definition_unfolding,[],[f482,f505]) ).
fof(f564,plain,
sK55 != sK56,
inference(definition_unfolding,[],[f500,f505,f502]) ).
fof(f565,plain,
ssList(sK56),
inference(definition_unfolding,[],[f497,f503]) ).
fof(f566,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f502]) ).
tcf(c_189,negated_conjecture,
! [X0: $i] :
( ( X0 = sK56 )
| ~ ssList(X0)
| ~ rearsegP(sK56,X0) ),
inference(cnf_transformation,[],[f523]) ).
tcf(c_229,negated_conjecture,
( ( app(sK56,sK56) = sK56 )
| ~ ssList(sK56) ),
inference(cnf_transformation,[],[f599]) ).
tcf(c_232,negated_conjecture,
! [X0: $i] :
( ( app(X0,sK56) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f561]) ).
tcf(c_246,negated_conjecture,
rearsegP(sK56,sK55),
inference(cnf_transformation,[],[f501]) ).
tcf(c_247,negated_conjecture,
sK56 != sK55,
inference(cnf_transformation,[],[f564]) ).
tcf(c_250,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f565]) ).
tcf(c_251,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f566]) ).
tcf(c_292,plain,
( ( app(sK56,sK56) = sK56 )
| ~ ssList(sK56) ),
inference(instantiation,[status(thm)],[c_232]) ).
tcf(c_364,negated_conjecture,
app(sK56,sK56) = sK56,
inference(global_subsumption_just,[status(thm)],[c_229,c_250,c_292]) ).
tcf(c_8769,definition,
iPr_def_10 = app(sK56,sK56),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_8776,negated_conjecture,
iPr_def_10 = sK56,
inference(demodulation,[status(thm)],[c_364,c_8769]) ).
tcf(c_8780,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_251]) ).
tcf(c_8781,negated_conjecture,
sK56 != sK55,
inference(demodulation,[status(thm)],[c_247]) ).
tcf(c_8782,negated_conjecture,
rearsegP(sK56,sK55),
inference(demodulation,[status(thm)],[c_246]) ).
tcf(c_8811,negated_conjecture,
! [X0: $i] :
( ( X0 = sK56 )
| ~ ssList(X0)
| ~ rearsegP(sK56,X0) ),
inference(demodulation,[status(thm)],[c_189]) ).
tcf(c_11623,plain,
rearsegP(iPr_def_10,sK55),
inference(light_normalisation,[status(thm)],[c_8782,c_8776]) ).
tcf(c_11628,plain,
sK55 != iPr_def_10,
inference(light_normalisation,[status(thm)],[c_8781,c_8776]) ).
tcf(c_11920,plain,
! [X0: $i] :
( ( X0 = iPr_def_10 )
| ~ ssList(X0)
| ~ rearsegP(iPr_def_10,X0) ),
inference(light_normalisation,[status(thm)],[c_8811,c_8776]) ).
tcf(c_11931,plain,
( ( sK55 = iPr_def_10 )
| ~ ssList(sK55) ),
inference(superposition,[status(thm)],[c_11623,c_11920]) ).
tcf(c_11933,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11931,c_11628,c_8780]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC044+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.36 % Computer : n011.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Thu Sep 24 16:04:42 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.40 Running first-order theorem proving
% 0.03/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.03/0.41
% 0.03/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.41
% 0.03/0.41 % Detected problem language: tptp
% 0.03/0.42 % Proving...
% 3.56/1.27 % SZS status Started for theBenchmark.p
% 3.56/1.27 % SZS status Theorem for theBenchmark.p
% 3.56/1.27
% 3.56/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.56/1.27
% 3.56/1.27 % ------ iProver source info
% 3.56/1.27
% 3.56/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 3.56/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.56/1.27 % git: non_committed_changes: false
% 3.56/1.27
% 3.56/1.27 % ------ Parsing...
% 3.56/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.56/1.27
% 3.56/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.56/1.27
% 3.56/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.56/1.27
% 3.56/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.56/1.27 % ------ Proving...
% 3.56/1.27 % ------ Problem Properties
% 3.56/1.27
% 3.56/1.27 %
% 3.56/1.27 % clauses 184
% 3.56/1.27 % conjectures 51
% 3.56/1.27 % EPR 53
% 3.56/1.27 % Horn 116
% 3.56/1.27 % unary 20
% 3.56/1.27 % binary 40
% 3.56/1.27 % lits 622
% 3.56/1.27 % lits eq 80
% 3.56/1.27 % fd_pure 0
% 3.56/1.27 % fd_pseudo 0
% 3.56/1.27 % fd_cond 21
% 3.56/1.27 % fd_pseudo_cond 14
% 3.56/1.27 % AC symbols 0
% 3.56/1.27
% 3.56/1.27 % ------ Schedule dynamic 5 is on
% 3.56/1.27
% 3.56/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.56/1.27
% 3.56/1.27
% 3.56/1.27 % ------
% 3.56/1.27 % Current options:
% 3.56/1.27 % ------
% 3.56/1.27
% 3.56/1.27
% 3.56/1.27 %
% 3.56/1.27
% 3.56/1.27 % ------ Proving...
% 3.56/1.27 %
% 3.56/1.27
% 3.56/1.27 % SZS status Theorem for theBenchmark.p
% 3.56/1.27
% 3.56/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.56/1.28
% 3.56/1.28
%------------------------------------------------------------------------------