%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC386+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 : n013.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:09:34 PM UTC 2026
% Result : Theorem 3.85s 1.17s
% Output : CNFRefutation 3.85s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f204ERROR: Could not build tree for root c_2498ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X5] :
( memberP(X1,X5)
& cons(X5,nil) = X0
& ssItem(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X5] :
( memberP(X1,X5)
& cons(X5,nil) = X0
& ssItem(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| 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)
& ( ( ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ssItem(X4)
& memberP(X3,X4)
& cons(X4,nil) = X2 ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ssItem(X4)
& memberP(X3,X4)
& cons(X4,nil) = X2 ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f111,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f124,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ( ! [X5] :
( ~ memberP(sK1,X5)
| cons(X5,nil) != sK0
| ~ ssItem(X5) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ( nil = sK2
& nil = sK3 )
| ( ssItem(sK4)
& memberP(sK3,sK4)
& sK2 = cons(sK4,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(f143,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f124]) ).
fof(f144,plain,
! [X5] :
( ~ memberP(sK1,X5)
| cons(X5,nil) != sK0
| ~ ssItem(X5)
| nil = sK1 ),
inference(cnf_transformation,[],[f124]) ).
fof(f146,plain,
( nil = sK2
| ssItem(sK4) ),
inference(cnf_transformation,[],[f124]) ).
fof(f147,plain,
( nil = sK3
| ssItem(sK4) ),
inference(cnf_transformation,[],[f124]) ).
fof(f148,plain,
( nil = sK2
| memberP(sK3,sK4) ),
inference(cnf_transformation,[],[f124]) ).
fof(f149,plain,
( nil = sK3
| memberP(sK3,sK4) ),
inference(cnf_transformation,[],[f124]) ).
fof(f150,plain,
( nil = sK2
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f124]) ).
fof(f151,plain,
( nil = sK3
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f124]) ).
fof(f152,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f124]) ).
fof(f153,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f124]) ).
fof(f171,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f172,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f193,plain,
! [X5] :
( ~ memberP(sK3,X5)
| cons(X5,nil) != sK2
| ~ ssItem(X5)
| nil = sK3 ),
inference(definition_unfolding,[],[f144,f153,f152,f153]) ).
fof(f194,plain,
( neq(sK3,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f143,f152,f153]) ).
tcf(c_49,negated_conjecture,
( ( nil = sK3 )
| ( cons(sK4,nil) = sK2 ) ),
inference(cnf_transformation,[],[f151]) ).
tcf(c_50,negated_conjecture,
( ( sK2 = nil )
| ( cons(sK4,nil) = sK2 ) ),
inference(cnf_transformation,[],[f150]) ).
tcf(c_51,negated_conjecture,
( memberP(sK3,sK4)
| ( nil = sK3 ) ),
inference(cnf_transformation,[],[f149]) ).
tcf(c_52,negated_conjecture,
( memberP(sK3,sK4)
| ( sK2 = nil ) ),
inference(cnf_transformation,[],[f148]) ).
tcf(c_53,negated_conjecture,
( ssItem(sK4)
| ( nil = sK3 ) ),
inference(cnf_transformation,[],[f147]) ).
tcf(c_54,negated_conjecture,
( ssItem(sK4)
| ( sK2 = nil ) ),
inference(cnf_transformation,[],[f146]) ).
tcf(c_56,negated_conjecture,
! [X0: $i] :
( ( nil = sK3 )
| ~ ssItem(X0)
| ~ memberP(sK3,X0)
| ( cons(X0,nil) != sK2 ) ),
inference(cnf_transformation,[],[f193]) ).
tcf(c_57,negated_conjecture,
( neq(sK3,nil)
| ( sK2 != nil ) ),
inference(cnf_transformation,[],[f194]) ).
tcf(c_77,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f204]) ).
tcf(c_80,plain,
ssList(nil),
inference(cnf_transformation,[],[f171]) ).
tcf(c_81,plain,
! [X0: $i] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(cnf_transformation,[],[f172]) ).
tcf(c_763,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( sK2 != nil )
| ( X0 != sK3 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_57,c_77]) ).
tcf(c_764,plain,
( ~ ssList(nil)
| ( nil != sK3 )
| ( sK2 != nil ) ),
inference(unflattening,[status(thm)],[c_763]) ).
tcf(c_787,negated_conjecture,
ssItem(sK4),
inference(global_subsumption_just,[status(thm)],[c_54,c_80,c_54,c_53,c_764]) ).
tcf(c_789,negated_conjecture,
ssItem(sK4),
inference(global_subsumption_just,[status(thm)],[c_53,c_787]) ).
tcf(c_791,negated_conjecture,
memberP(sK3,sK4),
inference(global_subsumption_just,[status(thm)],[c_52,c_80,c_52,c_51,c_764]) ).
tcf(c_793,negated_conjecture,
memberP(sK3,sK4),
inference(global_subsumption_just,[status(thm)],[c_51,c_791]) ).
tcf(c_795,negated_conjecture,
cons(sK4,nil) = sK2,
inference(global_subsumption_just,[status(thm)],[c_50,c_80,c_50,c_49,c_764]) ).
tcf(c_797,negated_conjecture,
cons(sK4,nil) = sK2,
inference(global_subsumption_just,[status(thm)],[c_49,c_795]) ).
tcf(c_2489,plain,
( ( nil = sK3 )
| ~ ssItem(sK4)
| ~ memberP(sK3,sK4) ),
inference(superposition,[status(thm)],[c_797,c_56]) ).
tcf(c_2490,plain,
nil = sK3,
inference(forward_subsumption_resolution,[status(thm)],[c_2489,c_789,c_793]) ).
tcf(c_2491,plain,
memberP(nil,sK4),
inference(demodulation,[status(thm)],[c_793,c_2490]) ).
tcf(c_2497,plain,
~ ssItem(sK4),
inference(superposition,[status(thm)],[c_2491,c_81]) ).
tcf(c_2498,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2497,c_789]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC386+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.09/0.34 % Computer : n013.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Thu Sep 24 17:57:51 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.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.42 % Proving...
% 3.85/1.17 % SZS status Started for theBenchmark.p
% 3.85/1.17 % SZS status Theorem for theBenchmark.p
% 3.85/1.17
% 3.85/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.85/1.17
% 3.85/1.17 % ------ iProver source info
% 3.85/1.17
% 3.85/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 3.85/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.85/1.17 % git: non_committed_changes: false
% 3.85/1.17
% 3.85/1.17 % ------ Parsing...
% 3.85/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.85/1.17
% 3.85/1.17 % ------ Preprocessing... sup_sim: 0 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 sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 3.85/1.17
% 3.85/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.85/1.17
% 3.85/1.17 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.85/1.17 % ------ Proving...
% 3.85/1.17 % ------ Problem Properties
% 3.85/1.17
% 3.85/1.17 %
% 3.85/1.17 % clauses 42
% 3.85/1.17 % conjectures 7
% 3.85/1.17 % EPR 10
% 3.85/1.17 % Horn 37
% 3.85/1.17 % unary 10
% 3.85/1.17 % binary 4
% 3.85/1.17 % lits 135
% 3.85/1.17 % lits eq 34
% 3.85/1.17 % fd_pure 0
% 3.85/1.17 % fd_pseudo 0
% 3.85/1.17 % fd_cond 4
% 3.85/1.17 % fd_pseudo_cond 5
% 3.85/1.17 % AC symbols 0
% 3.85/1.17
% 3.85/1.17 % ------ Schedule dynamic 5 is on
% 3.85/1.17
% 3.85/1.17 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.85/1.17
% 3.85/1.17
% 3.85/1.17 % ------
% 3.85/1.17 % Current options:
% 3.85/1.17 % ------
% 3.85/1.17
% 3.85/1.17
% 3.85/1.17 %
% 3.85/1.17
% 3.85/1.17 % ------ Proving...
% 3.85/1.17 %
% 3.85/1.17
% 3.85/1.17 % SZS status Theorem for theBenchmark.p
% 3.85/1.17
% 3.85/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.85/1.17
% 3.85/1.17
%------------------------------------------------------------------------------