%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC011-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 : n014.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 3.65s 6.50s
% Output : CNFRefutation 3.65s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f267ERROR: Could not build tree for root c_9125ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f217,negated_conjecture,
! [X2,X0,X1] :
( ~ neq(sk4,nil)
| app(X1,X2) != sk1
| app(app(X1,cons(X0,nil)),X2) != sk2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f218,plain,
! [X2,X0,X1] :
( ~ neq(sk4,nil)
| app(X1,X2) != sk1
| sk2 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f217]) ).
fof(f219,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
fof(f220,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
fof(f221,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
fof(f222,negated_conjecture,
( ~ neq(sk4,nil)
| app(app(sk6,cons(sk5,nil)),sk7) = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
fof(f223,plain,
( ~ neq(sk4,nil)
| sk4 = app(app(sk6,cons(sk5,nil)),sk7) ),
inference(reorient_equations,[],[f222]) ).
fof(f224,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,sk7) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_20) ).
fof(f225,plain,
( ~ neq(sk4,nil)
| sk3 = app(sk6,sk7) ),
inference(reorient_equations,[],[f224]) ).
fof(f236,plain,
! [X2,X0,X1] :
( ~ neq(sk4,nil)
| app(X1,X2) != sk3
| sk4 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(definition_unfolding,[],[f218,f204,f205]) ).
tcf(c_443,negated_conjecture,
neq(sk4,nil),
inference(cnf_transformation,[],[f267]) ).
tcf(c_450,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ neq(sk4,nil)
| ( app(X0,X1) != sk3 )
| ( app(app(X0,cons(X2,nil)),X1) != sk4 ) ),
inference(cnf_transformation,[],[f236]) ).
tcf(c_451,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f219]) ).
tcf(c_452,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f220]) ).
tcf(c_453,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_454,negated_conjecture,
( ( app(app(sk6,cons(sk5,nil)),sk7) = sk4 )
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f223]) ).
tcf(c_455,negated_conjecture,
( ( app(sk6,sk7) = sk3 )
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f225]) ).
tcf(c_570,negated_conjecture,
ssList(sk7),
inference(global_subsumption_just,[status(thm)],[c_453,c_443,c_453]) ).
tcf(c_572,negated_conjecture,
ssList(sk6),
inference(global_subsumption_just,[status(thm)],[c_452,c_443,c_452]) ).
tcf(c_574,negated_conjecture,
ssItem(sk5),
inference(global_subsumption_just,[status(thm)],[c_451,c_443,c_451]) ).
tcf(c_586,negated_conjecture,
app(sk6,sk7) = sk3,
inference(global_subsumption_just,[status(thm)],[c_455,c_443,c_455]) ).
tcf(c_594,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk4,
inference(global_subsumption_just,[status(thm)],[c_454,c_443,c_454]) ).
tcf(c_598,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(app(X0,cons(X2,nil)),X1) != sk4 )
| ( app(X0,X1) != sk3 ) ),
inference(global_subsumption_just,[status(thm)],[c_450,c_443,c_450]) ).
tcf(c_599,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(X0,X2) != sk3 )
| ( app(app(X0,cons(X1,nil)),X2) != sk4 ) ),
inference(renaming,[status(thm)],[c_598]) ).
tcf(c_6538,definition,
iPr_def_12 = cons(sk5,nil),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_6539,definition,
iPr_def_13 = app(sk6,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_6540,definition,
iPr_def_14 = app(iPr_def_13,sk7),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_6541,definition,
iPr_def_15 = app(sk6,sk7),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_6543,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(X0,X2) != sk3 )
| ( app(app(X0,cons(X1,nil)),X2) != sk4 ) ),
inference(demodulation,[status(thm)],[c_599]) ).
tcf(c_6544,negated_conjecture,
iPr_def_14 = sk4,
inference(demodulation,[status(thm)],[c_594,c_6538,c_6539,c_6540]) ).
tcf(c_6545,negated_conjecture,
iPr_def_15 = sk3,
inference(demodulation,[status(thm)],[c_586,c_6541]) ).
tcf(c_6546,negated_conjecture,
ssItem(sk5),
inference(demodulation,[status(thm)],[c_574]) ).
tcf(c_6547,negated_conjecture,
ssList(sk6),
inference(demodulation,[status(thm)],[c_572]) ).
tcf(c_6548,negated_conjecture,
ssList(sk7),
inference(demodulation,[status(thm)],[c_570]) ).
tcf(c_9085,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(X0,X2) != iPr_def_15 )
| ( app(app(X0,cons(X1,nil)),X2) != iPr_def_14 ) ),
inference(light_normalisation,[status(thm)],[c_6543,c_6544,c_6545]) ).
tcf(c_9096,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(sk5)
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != iPr_def_15 )
| ( app(app(X0,iPr_def_12),X1) != iPr_def_14 ) ),
inference(superposition,[status(thm)],[c_6538,c_9085]) ).
tcf(c_9097,plain,
! [X0: $i,X1: $i] :
( ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != iPr_def_15 )
| ( app(app(X0,iPr_def_12),X1) != iPr_def_14 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_9096,c_6546]) ).
tcf(c_9111,plain,
! [X0: $i] :
( ~ ssList(sk6)
| ~ ssList(X0)
| ( app(iPr_def_13,X0) != iPr_def_14 )
| ( app(sk6,X0) != iPr_def_15 ) ),
inference(superposition,[status(thm)],[c_6539,c_9097]) ).
tcf(c_9112,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( app(iPr_def_13,X0) != iPr_def_14 )
| ( app(sk6,X0) != iPr_def_15 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_9111,c_6547]) ).
tcf(c_9123,plain,
( ~ ssList(sk7)
| ( app(sk6,sk7) != iPr_def_15 ) ),
inference(superposition,[status(thm)],[c_6540,c_9112]) ).
tcf(c_9124,plain,
~ ssList(sk7),
inference(ground_joinability,[status(thm)],[c_9123,c_6541]) ).
tcf(c_9125,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_9124,c_6548]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC011-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.11/5.59 % Computer : n014.cluster.edu
% 0.11/5.59 % Model : x86_64 x86_64
% 0.11/5.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.59 % Memory : 8046.5625MB
% 0.11/5.59 % OS : Linux 6.8.0-71-generic
% 0.11/5.59 % CPULimit : 300
% 0.11/5.59 % WCLimit : 300
% 0.11/5.59 % DateTime : Thu Sep 24 15:53:54 UTC 2026
% 0.11/5.59 % CPUTime :
% 0.11/5.59 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/5.63 Running first-order theorem proving
% 0.16/5.63 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.16/5.64
% 0.16/5.64 % ======== iProver multi-core TPTP/SMT =========
% 0.16/5.64
% 0.16/5.65 % Detected problem language: tptp
% 0.16/5.66 % Proving...
% 3.65/6.50 % SZS status Started for theBenchmark.p
% 3.65/6.50 % SZS status Unsatisfiable for theBenchmark.p
% 3.65/6.50
% 3.65/6.50 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.65/6.50
% 3.65/6.50 % ------ iProver source info
% 3.65/6.50
% 3.65/6.50 % git: date: 2026-07-19 20:42:38 +0200
% 3.65/6.50 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.65/6.50 % git: non_committed_changes: false
% 3.65/6.50
% 3.65/6.50 % ------ Parsing...% successful
% 3.65/6.50
% 3.65/6.50
% 3.65/6.50 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.65/6.50
% 3.65/6.50 % ------ 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.65/6.50
% 3.65/6.50 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.65/6.50
% 3.65/6.50 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.65/6.50 % ------ Proving...
% 3.65/6.50 % ------ Problem Properties
% 3.65/6.50
% 3.65/6.50 %
% 3.65/6.50 % clauses 190
% 3.65/6.50 % conjectures 8
% 3.65/6.50 % EPR 60
% 3.65/6.50 % Horn 162
% 3.65/6.50 % unary 70
% 3.65/6.50 % binary 21
% 3.65/6.50 % lits 558
% 3.65/6.50 % lits eq 78
% 3.65/6.50 % fd_pure 0
% 3.65/6.50 % fd_pseudo 0
% 3.65/6.50 % fd_cond 15
% 3.65/6.50 % fd_pseudo_cond 14
% 3.65/6.50 % AC symbols 0
% 3.65/6.50
% 3.65/6.50 % ------ Schedule dynamic 5 is on
% 3.65/6.50
% 3.65/6.50 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.65/6.50
% 3.65/6.50
% 3.65/6.50 % ------
% 3.65/6.50 % Current options:
% 3.65/6.50 % ------
% 3.65/6.50
% 3.65/6.50
% 3.65/6.50 %
% 3.65/6.50
% 3.65/6.50 % ------ Proving...
% 3.65/6.50 %
% 3.65/6.50
% 3.65/6.50 % SZS status Unsatisfiable for theBenchmark.p
% 3.65/6.50
% 3.65/6.50 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.65/6.50
% 3.65/6.50
%------------------------------------------------------------------------------