%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC416-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 : n010.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:42 PM UTC 2026
% Result : Unsatisfiable 3.72s 6.27s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f239ERROR: Could not build tree for root c_2894ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f97,axiom,
! [X0,X1] :
( hd(cons(X0,X1)) = X0
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
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(f125,axiom,
! [X0,X1] :
( app(cons(X0,nil),X1) = cons(X0,X1)
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
fof(f126,plain,
! [X0,X1] :
( cons(X0,X1) = app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f125]) ).
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,
! [X2,X0,X1] :
( neq(sk2,nil)
| ~ neq(nil,sk2)
| hd(sk2) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| app(X1,sk1) != X0
| ~ ssList(X1)
| sk2 != X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f212,negated_conjecture,
! [X2,X0,X1] :
( ~ neq(sk4,nil)
| ~ neq(nil,sk2)
| hd(sk2) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| app(X1,sk1) != X0
| ~ ssList(X1)
| sk2 != X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f213,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f214,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk3) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f215,plain,
( ~ neq(sk4,nil)
| sk4 = app(cons(sk5,nil),sk3) ),
inference(reorient_equations,[],[f214]) ).
fof(f220,plain,
! [X2,X0,X1] :
( neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| app(X1,sk3) != X0
| ~ ssList(X1)
| sk4 != X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f208,f204,f205,f204,f204,f204]) ).
fof(f223,plain,
! [X2,X0,X1] :
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| app(X1,sk3) != X0
| ~ ssList(X1)
| sk4 != X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f212,f204,f205,f204,f204]) ).
fof(f224,plain,
! [X2,X1] :
( neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| sk4 != app(X1,sk3)
| ~ ssList(X1)
| ~ ssList(sk4) ),
inference(equality_resolution,[],[f220]) ).
fof(f225,plain,
! [X2] :
( neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| ~ ssItem(X2)
| sk4 != app(cons(X2,nil),sk3)
| ~ ssList(cons(X2,nil))
| ~ ssList(sk4) ),
inference(equality_resolution,[],[f224]) ).
fof(f226,plain,
( neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| sk4 != app(cons(hd(sk4),nil),sk3)
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(sk4) ),
inference(equality_resolution,[],[f225]) ).
fof(f227,plain,
! [X2,X1] :
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| sk4 != app(X1,sk3)
| ~ ssList(X1)
| ~ ssList(sk4) ),
inference(equality_resolution,[],[f223]) ).
fof(f228,plain,
! [X2] :
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| ~ ssItem(X2)
| sk4 != app(cons(X2,nil),sk3)
| ~ ssList(cons(X2,nil))
| ~ ssList(sk4) ),
inference(equality_resolution,[],[f227]) ).
fof(f229,plain,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| sk4 != app(cons(hd(sk4),nil),sk3)
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(sk4) ),
inference(equality_resolution,[],[f228]) ).
tcf(c_250,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_251,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_252,negated_conjecture,
neq(sk4,nil),
inference(cnf_transformation,[],[f239]) ).
tcf(c_253,negated_conjecture,
( neq(sk4,nil)
| ~ ssList(sk4)
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ ssList(cons(hd(sk4),nil))
| ( app(cons(hd(sk4),nil),sk3) != sk4 ) ),
inference(cnf_transformation,[],[f226]) ).
tcf(c_256,negated_conjecture,
( ~ ssList(sk4)
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ neq(sk4,nil)
| ~ ssList(cons(hd(sk4),nil))
| ( app(cons(hd(sk4),nil),sk3) != sk4 ) ),
inference(cnf_transformation,[],[f229]) ).
tcf(c_257,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f213]) ).
tcf(c_258,negated_conjecture,
( ( app(cons(sk5,nil),sk3) = sk4 )
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_260,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = cons(X1,X0) )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
tcf(c_266,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_268,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f242]) ).
tcf(c_270,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_275,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_285,plain,
! [X0: $i,X1: $i] :
( ( hd(cons(X1,X0)) = X1 )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f97]) ).
tcf(c_337,negated_conjecture,
ssItem(sk5),
inference(global_subsumption_just,[status(thm)],[c_257,c_252,c_257]) ).
tcf(c_347,negated_conjecture,
app(cons(sk5,nil),sk3) = sk4,
inference(global_subsumption_just,[status(thm)],[c_258,c_252,c_258]) ).
tcf(c_349,negated_conjecture,
neq(sk4,nil),
inference(global_subsumption_just,[status(thm)],[c_253,c_252]) ).
tcf(c_351,plain,
( ~ ssList(cons(hd(sk4),nil))
| ( app(cons(hd(sk4),nil),sk3) != sk4 )
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4)) ),
inference(global_subsumption_just,[status(thm)],[c_256,c_251,c_252,c_256]) ).
tcf(c_352,negated_conjecture,
( ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ ssList(cons(hd(sk4),nil))
| ( app(cons(hd(sk4),nil),sk3) != sk4 ) ),
inference(renaming,[status(thm)],[c_351]) ).
tcf(c_1095,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_349,c_268]) ).
tcf(c_1096,plain,
( ~ ssList(sk4)
| ( sk4 != nil ) ),
inference(unflattening,[status(thm)],[c_1095]) ).
tcf(c_1123,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ( X1 != nil )
| ( X0 != sk4 )
| ( app(cons(hd(sk4),nil),sk3) != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_270,c_352]) ).
tcf(c_1124,plain,
( ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ( app(cons(hd(sk4),nil),sk3) != sk4 ) ),
inference(unflattening,[status(thm)],[c_1123]) ).
tcf(c_1125,plain,
( ( app(cons(hd(sk4),nil),sk3) != sk4 )
| ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4)) ),
inference(global_subsumption_just,[status(thm)],[c_1124,c_251,c_266,c_1096,c_1124]) ).
tcf(c_1126,plain,
( ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ( app(cons(hd(sk4),nil),sk3) != sk4 ) ),
inference(renaming,[status(thm)],[c_1125]) ).
tcf(c_2771,plain,
! [X0: $i] :
( ( hd(cons(X0,sk3)) = X0 )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_250,c_285]) ).
tcf(c_2817,plain,
! [X0: $i] :
( ( app(cons(X0,nil),sk3) = cons(X0,sk3) )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_250,c_260]) ).
tcf(c_2842,plain,
hd(cons(sk5,sk3)) = sk5,
inference(superposition,[status(thm)],[c_337,c_2771]) ).
tcf(c_2882,plain,
app(cons(sk5,nil),sk3) = cons(sk5,sk3),
inference(superposition,[status(thm)],[c_337,c_2817]) ).
tcf(c_2884,plain,
cons(sk5,sk3) = sk4,
inference(light_normalisation,[status(thm)],[c_2882,c_347]) ).
tcf(c_2889,plain,
hd(sk4) = sk5,
inference(demodulation,[status(thm)],[c_2842,c_2884]) ).
tcf(c_2890,plain,
( ~ ssItem(sk5)
| ~ ssList(cons(sk5,nil))
| ( app(cons(sk5,nil),sk3) != sk4 ) ),
inference(demodulation,[status(thm)],[c_1126,c_2889]) ).
tcf(c_2891,plain,
( ~ ssItem(sk5)
| ~ ssList(cons(sk5,nil)) ),
inference(ground_joinability,[status(thm)],[c_2890,c_347]) ).
tcf(c_2892,plain,
~ ssList(cons(sk5,nil)),
inference(forward_subsumption_resolution,[status(thm)],[c_2891,c_337]) ).
tcf(c_2893,plain,
( ~ ssItem(sk5)
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_275,c_2892]) ).
tcf(c_2894,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2893,c_337,c_266]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC416-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.10/5.37 % Computer : n010.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Thu Sep 24 18:09:27 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.41 Running first-order theorem proving
% 0.15/5.41 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.15/5.42
% 0.15/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.42
% 0.15/5.42 % Detected problem language: tptp
% 0.15/5.43 % Proving...
% 3.72/6.27 % SZS status Started for theBenchmark.p
% 3.72/6.27 % SZS status Unsatisfiable for theBenchmark.p
% 3.72/6.27
% 3.72/6.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.72/6.27
% 3.72/6.27 % ------ iProver source info
% 3.72/6.27
% 3.72/6.27 % git: date: 2026-07-19 20:42:38 +0200
% 3.72/6.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.72/6.27 % git: non_committed_changes: false
% 3.72/6.27
% 3.72/6.27 % ------ Parsing...% successful
% 3.72/6.27
% 3.72/6.27
% 3.72/6.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.72/6.27
% 3.72/6.27 % ------ 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 %
% 3.72/6.27
% 3.72/6.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.72/6.27
% 3.72/6.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.72/6.27 % ------ Proving...
% 3.72/6.27 % ------ Problem Properties
% 3.72/6.27
% 3.72/6.27 %
% 3.72/6.27 % clauses 47
% 3.72/6.27 % conjectures 4
% 3.72/6.27 % EPR 16
% 3.72/6.27 % Horn 38
% 3.72/6.27 % unary 9
% 3.72/6.27 % binary 6
% 3.72/6.27 % lits 171
% 3.72/6.27 % lits eq 35
% 3.72/6.27 % fd_pure 0
% 3.72/6.27 % fd_pseudo 0
% 3.72/6.27 % fd_cond 10
% 3.72/6.27 % fd_pseudo_cond 6
% 3.72/6.27 % AC symbols 0
% 3.72/6.27
% 3.72/6.27 % ------ Schedule dynamic 5 is on
% 3.72/6.27
% 3.72/6.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.72/6.27
% 3.72/6.27
% 3.72/6.27 % ------
% 3.72/6.27 % Current options:
% 3.72/6.27 % ------
% 3.72/6.27
% 3.72/6.27
% 3.72/6.27 %
% 3.72/6.27
% 3.72/6.27 % ------ Proving...
% 3.72/6.27 %
% 3.72/6.27
% 3.72/6.27 % SZS status Unsatisfiable for theBenchmark.p
% 3.72/6.27
% 3.72/6.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.72/6.27
% 3.72/6.27
%------------------------------------------------------------------------------