%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC013-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 : n012.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:30 PM UTC 2026
% Result : Unsatisfiable 2.14s 6.28s
% Output : CNFRefutation 2.14s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f257ERROR: Could not build tree for root c_9597ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f78,axiom,
! [X0] :
( nil = X0
| ssItem(hd(X0))
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause78) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f101,axiom,
! [X0,X1] :
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( X0 = X1
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(reorient_equations,[],[f101]) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
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(f208,negated_conjecture,
! [X0,X1] :
( neq(sk2,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X1
| cons(X1,nil) != X0
| ~ ssItem(X1)
| sk3 = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f210,negated_conjecture,
! [X0,X1] :
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X1
| cons(X1,nil) != X0
| ~ ssItem(X1)
| sk3 = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
! [X0,X1] :
( ~ neq(sk4,nil)
| ~ neq(nil,sk2)
| hd(sk2) != X1
| cons(X1,nil) != X0
| ~ ssItem(X1)
| sk1 != X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f216,plain,
! [X0,X1] :
( neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X1
| cons(X1,nil) != X0
| ~ ssItem(X1)
| sk3 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f208,f204]) ).
fof(f218,plain,
! [X0,X1] :
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X1
| cons(X1,nil) != X0
| ~ ssItem(X1)
| sk3 != X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f211,f205,f204,f204]) ).
fof(f243,plain,
! [X1] :
( neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X1
| ~ ssItem(X1)
| sk3 = cons(X1,nil)
| ~ ssList(cons(X1,nil)) ),
inference(equality_resolution,[],[f216]) ).
fof(f244,plain,
( neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| sk3 = cons(hd(sk4),nil)
| ~ ssList(cons(hd(sk4),nil)) ),
inference(equality_resolution,[],[f243]) ).
fof(f247,plain,
! [X1] :
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X1
| ~ ssItem(X1)
| sk3 = cons(X1,nil)
| ~ ssList(cons(X1,nil)) ),
inference(equality_resolution,[],[f210]) ).
fof(f248,plain,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| sk3 = cons(hd(sk4),nil)
| ~ ssList(cons(hd(sk4),nil)) ),
inference(equality_resolution,[],[f247]) ).
fof(f249,plain,
! [X1] :
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X1
| sk3 != cons(X1,nil)
| ~ ssItem(X1)
| ~ ssList(sk3) ),
inference(equality_resolution,[],[f218]) ).
fof(f250,plain,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| sk3 != cons(hd(sk4),nil)
| ~ ssItem(hd(sk4))
| ~ ssList(sk3) ),
inference(equality_resolution,[],[f249]) ).
tcf(c_253,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_323,plain,
! [X0: $i] :
( ssItem(hd(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f78]) ).
tcf(c_331,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_345,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_360,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f252]) ).
tcf(c_433,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_434,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_435,negated_conjecture,
neq(sk4,nil),
inference(cnf_transformation,[],[f257]) ).
tcf(c_436,negated_conjecture,
( neq(sk4,nil)
| ( cons(hd(sk4),nil) = sk3 )
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cnf_transformation,[],[f244]) ).
tcf(c_438,negated_conjecture,
( ( cons(hd(sk4),nil) = sk3 )
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ neq(sk4,nil)
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cnf_transformation,[],[f248]) ).
tcf(c_439,negated_conjecture,
( ~ ssList(sk3)
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ neq(sk4,nil)
| ( cons(hd(sk4),nil) != sk3 ) ),
inference(cnf_transformation,[],[f250]) ).
tcf(c_561,plain,
( ( cons(hd(sk4),nil) != sk3 )
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4)) ),
inference(global_subsumption_just,[status(thm)],[c_439,c_433,c_435,c_439]) ).
tcf(c_562,negated_conjecture,
( ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ( cons(hd(sk4),nil) != sk3 ) ),
inference(renaming,[status(thm)],[c_561]) ).
tcf(c_563,negated_conjecture,
neq(sk4,nil),
inference(global_subsumption_just,[status(thm)],[c_436,c_435]) ).
tcf(c_565,plain,
( ~ ssList(cons(hd(sk4),nil))
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4)) ),
inference(global_subsumption_just,[status(thm)],[c_438,c_435,c_438,c_562]) ).
tcf(c_566,negated_conjecture,
( ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ ssList(cons(hd(sk4),nil)) ),
inference(renaming,[status(thm)],[c_565]) ).
tcf(c_2995,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_563,c_360]) ).
tcf(c_2996,plain,
( ~ ssList(sk4)
| ( sk4 != nil ) ),
inference(unflattening,[status(thm)],[c_2995]) ).
tcf(c_2997,plain,
sk4 != nil,
inference(global_subsumption_just,[status(thm)],[c_2996,c_434,c_2996]) ).
tcf(c_3018,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ( X1 != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_566,c_345]) ).
tcf(c_3019,plain,
( ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(unflattening,[status(thm)],[c_3018]) ).
tcf(c_3020,plain,
( ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4)) ),
inference(global_subsumption_just,[status(thm)],[c_3019,c_434,c_253,c_2996,c_3019]) ).
tcf(c_3021,plain,
( ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(renaming,[status(thm)],[c_3020]) ).
tcf(c_6560,definition,
iPr_def_12 = hd(sk4),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_6561,definition,
iPr_def_13 = cons(iPr_def_12,nil),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_6563,plain,
( ~ ssItem(iPr_def_12)
| ~ ssList(iPr_def_13) ),
inference(demodulation,[status(thm)],[c_3021]) ).
tcf(c_6564,plain,
sk4 != nil,
inference(demodulation,[status(thm)],[c_2997]) ).
tcf(c_6565,negated_conjecture,
ssList(sk4),
inference(demodulation,[status(thm)],[c_434]) ).
tcf(c_9546,plain,
( ssItem(iPr_def_12)
| ( sk4 = nil )
| ~ ssList(sk4) ),
inference(superposition,[status(thm)],[c_6560,c_323]) ).
tcf(c_9547,plain,
ssItem(iPr_def_12),
inference(forward_subsumption_resolution,[status(thm)],[c_9546,c_6564,c_6565]) ).
tcf(c_9555,plain,
~ ssList(iPr_def_13),
inference(backward_subsumption_resolution,[status(thm)],[c_6563,c_9547]) ).
tcf(c_9593,plain,
( ssList(iPr_def_13)
| ~ ssItem(iPr_def_12)
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_6561,c_331]) ).
tcf(c_9597,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_9593,c_9555,c_9547,c_253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC013-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/5.52 % Computer : n012.cluster.edu
% 0.03/5.52 % Model : x86_64 x86_64
% 0.03/5.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/5.52 % Memory : 8046.5625MB
% 0.03/5.52 % OS : Linux 6.8.0-71-generic
% 0.03/5.52 % CPULimit : 300
% 0.03/5.52 % WCLimit : 300
% 0.03/5.52 % DateTime : Thu Sep 24 15:55:11 UTC 2026
% 0.03/5.52 % CPUTime :
% 0.03/5.52 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/5.54 Running first-order theorem proving
% 0.03/5.54 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/5.55
% 0.03/5.55 % ======== iProver multi-core TPTP/SMT =========
% 0.03/5.55
% 0.03/5.55 % Detected problem language: tptp
% 0.03/5.55 % Proving...
% 2.14/6.28 % SZS status Started for theBenchmark.p
% 2.14/6.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.14/6.28
% 2.14/6.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.14/6.28
% 2.14/6.28 % ------ iProver source info
% 2.14/6.28
% 2.14/6.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.14/6.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.14/6.28 % git: non_committed_changes: false
% 2.14/6.28
% 2.14/6.28 % ------ Parsing...% successful
% 2.14/6.28
% 2.14/6.28
% 2.14/6.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.14/6.28
% 2.14/6.28 % ------ 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 %
% 2.14/6.28
% 2.14/6.28 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.14/6.28
% 2.14/6.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.14/6.28 % ------ Proving...
% 2.14/6.28 % ------ Problem Properties
% 2.14/6.28
% 2.14/6.28 %
% 2.14/6.28 % clauses 184
% 2.14/6.28 % conjectures 2
% 2.14/6.28 % EPR 57
% 2.14/6.28 % Horn 156
% 2.14/6.28 % unary 63
% 2.14/6.28 % binary 23
% 2.14/6.28 % lits 550
% 2.14/6.28 % lits eq 73
% 2.14/6.28 % fd_pure 0
% 2.14/6.28 % fd_pseudo 0
% 2.14/6.28 % fd_cond 15
% 2.14/6.28 % fd_pseudo_cond 14
% 2.14/6.28 % AC symbols 0
% 2.14/6.28
% 2.14/6.28 % ------ Schedule dynamic 5 is on
% 2.14/6.28
% 2.14/6.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.14/6.28
% 2.14/6.28
% 2.14/6.28 % ------
% 2.14/6.28 % Current options:
% 2.14/6.28 % ------
% 2.14/6.28
% 2.14/6.28
% 2.14/6.28 %
% 2.14/6.28
% 2.14/6.28 % ------ Proving...
% 2.14/6.28 %
% 2.14/6.28
% 2.14/6.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.14/6.28
% 2.14/6.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.14/6.28
% 2.14/6.28
%------------------------------------------------------------------------------