%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC105+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 : n001.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:55 PM UTC 2026
% Result : Theorem 3.85s 1.32s
% Output : CNFRefutation 3.85s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f204ERROR: Could not build tree for root c_1727ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f52,axiom,
! [X0] :
( ssList(X0)
=> ( rearsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax52) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ( rearsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ( rearsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| 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)
& ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f105,plain,
! [X0] :
( ~ ssList(X0)
| ( rearsegP(nil,X0)
<=> nil = X0 ) ),
inference(ennf_transformation,[],[f52]) ).
fof(f130,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ( rearsegP(sK3,sK2)
& neq(sK2,nil) )
| ( nil = sK2
& nil = sK3 ) )
& ( ( ( ~ rearsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& sK0 = sK2
& sK1 = sK3 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f99]) ).
fof(f135,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ rearsegP(nil,X0)
| nil = X0 )
& ( nil != X0
| rearsegP(nil,X0) ) ) ),
inference(nnf_transformation,[],[f105]) ).
fof(f141,plain,
ssList(sK0),
inference(cnf_transformation,[],[f130]) ).
fof(f145,plain,
( rearsegP(sK3,sK2)
| nil = sK2 ),
inference(cnf_transformation,[],[f130]) ).
fof(f147,plain,
( rearsegP(sK3,sK2)
| nil = sK3 ),
inference(cnf_transformation,[],[f130]) ).
fof(f148,plain,
( neq(sK2,nil)
| nil = sK3 ),
inference(cnf_transformation,[],[f130]) ).
fof(f149,plain,
( ~ rearsegP(sK1,sK0)
| ~ neq(sK0,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f130]) ).
fof(f150,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f130]) ).
fof(f151,plain,
( ~ rearsegP(sK1,sK0)
| ~ neq(sK0,nil)
| nil = sK1 ),
inference(cnf_transformation,[],[f130]) ).
fof(f153,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f130]) ).
fof(f154,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f130]) ).
fof(f166,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f167,plain,
! [X0] :
( ~ ssList(X0)
| ~ rearsegP(nil,X0)
| nil = X0 ),
inference(cnf_transformation,[],[f135]) ).
fof(f193,plain,
( ~ rearsegP(sK3,sK2)
| ~ neq(sK2,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f151,f154,f153,f154,f153]) ).
fof(f194,plain,
( neq(sK3,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f150,f153,f154]) ).
fof(f195,plain,
( ~ rearsegP(sK3,sK2)
| ~ neq(sK2,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f149,f153,f153,f154,f153]) ).
fof(f197,plain,
ssList(sK2),
inference(definition_unfolding,[],[f141,f153]) ).
tcf(c_50,negated_conjecture,
( ( nil = sK3 )
| ~ rearsegP(sK3,sK2)
| ~ neq(sK2,nil) ),
inference(cnf_transformation,[],[f193]) ).
tcf(c_51,negated_conjecture,
( neq(sK3,nil)
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f194]) ).
tcf(c_52,negated_conjecture,
( ~ rearsegP(sK3,sK2)
| ~ neq(sK2,nil)
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f195]) ).
tcf(c_53,negated_conjecture,
( neq(sK2,nil)
| ( nil = sK3 ) ),
inference(cnf_transformation,[],[f148]) ).
tcf(c_54,negated_conjecture,
( rearsegP(sK3,sK2)
| ( nil = sK3 ) ),
inference(cnf_transformation,[],[f147]) ).
tcf(c_56,negated_conjecture,
( rearsegP(sK3,sK2)
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f145]) ).
tcf(c_60,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f197]) ).
tcf(c_65,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f204]) ).
tcf(c_72,plain,
ssList(nil),
inference(cnf_transformation,[],[f166]) ).
tcf(c_74,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ rearsegP(nil,X0) ),
inference(cnf_transformation,[],[f167]) ).
tcf(c_100,plain,
( ~ ssList(nil)
| ~ neq(nil,nil) ),
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_123,negated_conjecture,
nil = sK3,
inference(global_subsumption_just,[status(thm)],[c_54,c_54,c_53,c_50]) ).
tcf(c_131,negated_conjecture,
nil = sK3,
inference(global_subsumption_just,[status(thm)],[c_50,c_123]) ).
tcf(c_411,plain,
( rearsegP(nil,sK2)
| ( nil = sK2 ) ),
inference(light_normalisation,[status(thm)],[c_56,c_131]) ).
tcf(c_422,plain,
( neq(nil,nil)
| ( nil != sK2 ) ),
inference(light_normalisation,[status(thm)],[c_51,c_131]) ).
tcf(c_501,plain,
( ~ rearsegP(nil,sK2)
| ~ neq(sK2,nil)
| ( nil != sK2 ) ),
inference(light_normalisation,[status(thm)],[c_52,c_131]) ).
tcf(c_665,plain,
( ~ rearsegP(nil,sK2)
| ( nil != sK2 )
| ( nil != nil ) ),
inference(resolution_lifted,[status(thm)],[c_501,c_422]) ).
tcf(c_666,plain,
nil != sK2,
inference(global_subsumption_just,[status(thm)],[c_665,c_72,c_100,c_422]) ).
tcf(c_684,plain,
rearsegP(nil,sK2),
inference(backward_subsumption_resolution,[status(thm)],[c_411,c_666]) ).
tcf(c_1726,plain,
( ( nil = sK2 )
| ~ ssList(sK2) ),
inference(superposition,[status(thm)],[c_684,c_74]) ).
tcf(c_1727,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1726,c_666,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC105+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n001.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 16:30:22 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/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.12/0.44
% 0.12/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.44
% 0.12/0.44 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 3.85/1.32 % SZS status Started for theBenchmark.p
% 3.85/1.32 % SZS status Theorem for theBenchmark.p
% 3.85/1.32
% 3.85/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.85/1.32
% 3.85/1.32 % ------ iProver source info
% 3.85/1.32
% 3.85/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 3.85/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.85/1.32 % git: non_committed_changes: false
% 3.85/1.32
% 3.85/1.32 % ------ Parsing...
% 3.85/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.85/1.32
% 3.85/1.32 % ------ Preprocessing... sup_sim: 5 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 3.85/1.32
% 3.85/1.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.85/1.32
% 3.85/1.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.85/1.32 % ------ Proving...
% 3.85/1.32 % ------ Problem Properties
% 3.85/1.32
% 3.85/1.32 %
% 3.85/1.32 % clauses 37
% 3.85/1.32 % conjectures 2
% 3.85/1.32 % EPR 14
% 3.85/1.32 % Horn 34
% 3.85/1.32 % unary 10
% 3.85/1.32 % binary 4
% 3.85/1.32 % lits 110
% 3.85/1.32 % lits eq 30
% 3.85/1.32 % fd_pure 0
% 3.85/1.32 % fd_pseudo 0
% 3.85/1.32 % fd_cond 5
% 3.85/1.32 % fd_pseudo_cond 5
% 3.85/1.32 % AC symbols 0
% 3.85/1.32
% 3.85/1.32 % ------ Schedule dynamic 5 is on
% 3.85/1.32
% 3.85/1.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.85/1.32
% 3.85/1.32
% 3.85/1.32 % ------
% 3.85/1.32 % Current options:
% 3.85/1.32 % ------
% 3.85/1.32
% 3.85/1.32
% 3.85/1.32 %
% 3.85/1.32
% 3.85/1.32 % ------ Proving...
% 3.85/1.32 %
% 3.85/1.32
% 3.85/1.32 % SZS status Theorem for theBenchmark.p
% 3.85/1.32
% 3.85/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.85/1.32
% 3.85/1.32
%------------------------------------------------------------------------------