%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC207+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:08:52 PM UTC 2026
% Result : Theorem 3.65s 1.17s
% Output : CNFRefutation 3.65s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f231ERROR: Could not build tree for root c_3196ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X4,X5)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| neq(X0,nil)
| ~ neq(X1,nil)
| 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)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X4,X5)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| neq(X0,nil)
| ~ neq(X1,nil)
| 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)
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ssItem(X4)
& ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2 ) )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ssItem(X4)
& ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2 ) )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f109,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f111,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f139,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ( nil = sK2
& nil = sK3 )
| ( ssItem(sK4)
& ! [X5] :
( ~ leq(sK4,X5)
| ~ memberP(sK3,X5)
| sK4 = X5
| ~ ssItem(X5) )
& memberP(sK3,sK4)
& sK2 = cons(sK4,nil) ) )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& 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(f142,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f109]) ).
fof(f155,plain,
ssList(sK0),
inference(cnf_transformation,[],[f139]) ).
fof(f156,plain,
ssList(sK1),
inference(cnf_transformation,[],[f139]) ).
fof(f160,plain,
( nil = sK3
| ssItem(sK4) ),
inference(cnf_transformation,[],[f139]) ).
fof(f166,plain,
( nil = sK3
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f139]) ).
fof(f167,plain,
~ neq(sK0,nil),
inference(cnf_transformation,[],[f139]) ).
fof(f168,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f139]) ).
fof(f169,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f139]) ).
fof(f170,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f139]) ).
fof(f185,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f142]) ).
fof(f188,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f189,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f220,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f168,f170]) ).
fof(f221,plain,
~ neq(sK2,nil),
inference(definition_unfolding,[],[f167,f169]) ).
fof(f222,plain,
ssList(sK3),
inference(definition_unfolding,[],[f156,f170]) ).
fof(f223,plain,
ssList(sK2),
inference(definition_unfolding,[],[f155,f169]) ).
tcf(c_49,negated_conjecture,
neq(sK3,nil),
inference(cnf_transformation,[],[f220]) ).
tcf(c_50,negated_conjecture,
~ neq(sK2,nil),
inference(cnf_transformation,[],[f221]) ).
tcf(c_51,negated_conjecture,
( ( sK3 = nil )
| ( cons(sK4,nil) = sK2 ) ),
inference(cnf_transformation,[],[f166]) ).
tcf(c_57,negated_conjecture,
( ssItem(sK4)
| ( sK3 = nil ) ),
inference(cnf_transformation,[],[f160]) ).
tcf(c_61,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f222]) ).
tcf(c_62,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f223]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f185]) ).
tcf(c_77,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f231]) ).
tcf(c_80,plain,
ssList(nil),
inference(cnf_transformation,[],[f188]) ).
tcf(c_81,plain,
! [X0: $i] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(cnf_transformation,[],[f189]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i] :
( memberP(cons(X0,X1),X0)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f233]) ).
tcf(c_938,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_77]) ).
tcf(c_939,plain,
( ~ ssList(sK3)
| ( sK3 != nil ) ),
inference(unflattening,[status(thm)],[c_938]) ).
tcf(c_940,plain,
sK3 != nil,
inference(global_subsumption_just,[status(thm)],[c_939,c_61,c_939]) ).
tcf(c_956,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != sK2 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_76]) ).
tcf(c_957,plain,
( ( nil = sK2 )
| ~ ssList(sK2)
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_956]) ).
tcf(c_958,plain,
nil = sK2,
inference(global_subsumption_just,[status(thm)],[c_957,c_62,c_80,c_957]) ).
tcf(c_975,plain,
cons(sK4,nil) = sK2,
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_940]) ).
tcf(c_976,plain,
ssItem(sK4),
inference(backward_subsumption_resolution,[status(thm)],[c_57,c_940]) ).
tcf(c_1325,plain,
cons(sK4,nil) = nil,
inference(light_normalisation,[status(thm)],[c_975,c_958]) ).
tcf(c_3193,plain,
( memberP(nil,sK4)
| ~ ssList(nil)
| ~ ssItem(sK4) ),
inference(superposition,[status(thm)],[c_1325,c_82]) ).
tcf(c_3194,plain,
memberP(nil,sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_3193,c_80,c_976]) ).
tcf(c_3195,plain,
~ ssItem(sK4),
inference(superposition,[status(thm)],[c_3194,c_81]) ).
tcf(c_3196,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3195,c_976]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC207+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.08/0.35 % Computer : n001.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 17:04:37 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.38 Running first-order theorem proving
% 0.14/0.38 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.14/0.40
% 0.14/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.40
% 0.14/0.40 % Detected problem language: tptp
% 0.14/0.41 % Proving...
% 3.65/1.17 % SZS status Started for theBenchmark.p
% 3.65/1.17 % SZS status Theorem for theBenchmark.p
% 3.65/1.17
% 3.65/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.65/1.17
% 3.65/1.17 % ------ iProver source info
% 3.65/1.17
% 3.65/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 3.65/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.65/1.17 % git: non_committed_changes: false
% 3.65/1.17
% 3.65/1.17 % ------ Parsing...
% 3.65/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.65/1.17
% 3.65/1.17 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 4 sf_s rm: 2 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 3.65/1.17
% 3.65/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.65/1.17
% 3.65/1.17 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.65/1.17 % ------ Proving...
% 3.65/1.17 % ------ Problem Properties
% 3.65/1.17
% 3.65/1.17 %
% 3.65/1.17 % clauses 50
% 3.65/1.17 % conjectures 1
% 3.65/1.17 % EPR 20
% 3.65/1.17 % Horn 44
% 3.65/1.17 % unary 11
% 3.65/1.17 % binary 5
% 3.65/1.17 % lits 170
% 3.65/1.17 % lits eq 33
% 3.65/1.17 % fd_pure 0
% 3.65/1.17 % fd_pseudo 0
% 3.65/1.17 % fd_cond 5
% 3.65/1.17 % fd_pseudo_cond 7
% 3.65/1.17 % AC symbols 0
% 3.65/1.17
% 3.65/1.17 % ------ Schedule dynamic 5 is on
% 3.65/1.17
% 3.65/1.17 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.65/1.17
% 3.65/1.17
% 3.65/1.17 % ------
% 3.65/1.17 % Current options:
% 3.65/1.17 % ------
% 3.65/1.17
% 3.65/1.17
% 3.65/1.17 %
% 3.65/1.17
% 3.65/1.17 % ------ Proving...
% 3.65/1.17 %
% 3.65/1.17
% 3.65/1.17 % SZS status Theorem for theBenchmark.p
% 3.65/1.17
% 3.65/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.65/1.17
% 3.65/1.17
%------------------------------------------------------------------------------