%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC322-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 : 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:09:18 PM UTC 2026
% Result : Unsatisfiable 1.87s 11.19s
% Output : CNFRefutation 1.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 15
% Syntax : Number of formulae : 60 ( 20 unt; 3 def)
% Number of atoms : 136 ( 79 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 108 ( 53 ~; 55 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 13 !; 0 ?; 9 :)
% 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(f206,negated_conjecture,
! [X0,X1] :
( app(X1,cons(X0,nil)) != sk4
| app(cons(X0,nil),X1) = sk3
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,plain,
! [X0,X1] :
( sk4 != app(X1,cons(X0,nil))
| app(cons(X0,nil),X1) = sk3
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f206]) ).
fof(f208,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f209,negated_conjecture,
( nil = sk2
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f210,negated_conjecture,
( nil != sk1
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f211,negated_conjecture,
( nil = sk2
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f212,negated_conjecture,
( nil = sk2
| app(sk6,cons(sk5,nil)) = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f213,plain,
( nil = sk2
| sk2 = app(sk6,cons(sk5,nil)) ),
inference(reorient_equations,[],[f212]) ).
fof(f214,negated_conjecture,
( nil = sk2
| app(cons(sk5,nil),sk6) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f215,plain,
( nil = sk2
| sk1 != app(cons(sk5,nil),sk6) ),
inference(reorient_equations,[],[f214]) ).
fof(f216,negated_conjecture,
( nil != sk1
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f217,negated_conjecture,
( nil != sk1
| app(sk6,cons(sk5,nil)) = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f218,plain,
( nil != sk1
| sk2 = app(sk6,cons(sk5,nil)) ),
inference(reorient_equations,[],[f217]) ).
fof(f219,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
fof(f220,plain,
( nil != sk1
| sk1 != app(cons(sk5,nil),sk6) ),
inference(reorient_equations,[],[f219]) ).
fof(f223,plain,
( nil = sk4
| ssItem(sk5) ),
inference(definition_unfolding,[],[f209,f204]) ).
fof(f224,plain,
( nil != sk3
| ssItem(sk5) ),
inference(definition_unfolding,[],[f210,f205]) ).
fof(f225,plain,
( nil = sk4
| ssList(sk6) ),
inference(definition_unfolding,[],[f211,f204]) ).
fof(f226,plain,
( nil = sk4
| sk4 = app(sk6,cons(sk5,nil)) ),
inference(definition_unfolding,[],[f213,f204,f204]) ).
fof(f227,plain,
( nil = sk4
| sk3 != app(cons(sk5,nil),sk6) ),
inference(definition_unfolding,[],[f215,f205,f204]) ).
fof(f228,plain,
( nil != sk3
| ssList(sk6) ),
inference(definition_unfolding,[],[f216,f205]) ).
fof(f229,plain,
( nil != sk3
| sk4 = app(sk6,cons(sk5,nil)) ),
inference(definition_unfolding,[],[f218,f204,f205]) ).
fof(f230,plain,
( nil != sk3
| sk3 != app(cons(sk5,nil),sk6) ),
inference(definition_unfolding,[],[f220,f205,f205]) ).
tcf(c_439,negated_conjecture,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = sk3 )
| ~ ssItem(X1)
| ~ ssList(X0)
| ( app(X0,cons(X1,nil)) != sk4 ) ),
inference(cnf_transformation,[],[f207]) ).
tcf(c_440,negated_conjecture,
( ( sk3 = nil )
| ( sk4 != nil ) ),
inference(cnf_transformation,[],[f208]) ).
tcf(c_441,negated_conjecture,
( ssItem(sk5)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f223]) ).
tcf(c_442,negated_conjecture,
( ssItem(sk5)
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f224]) ).
tcf(c_443,negated_conjecture,
( ssList(sk6)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f225]) ).
tcf(c_444,negated_conjecture,
( ( sk4 = nil )
| ( app(sk6,cons(sk5,nil)) = sk4 ) ),
inference(cnf_transformation,[],[f226]) ).
tcf(c_445,negated_conjecture,
( ( sk4 = nil )
| ( app(cons(sk5,nil),sk6) != sk3 ) ),
inference(cnf_transformation,[],[f227]) ).
tcf(c_446,negated_conjecture,
( ssList(sk6)
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f228]) ).
tcf(c_447,negated_conjecture,
( ( app(sk6,cons(sk5,nil)) = sk4 )
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f229]) ).
tcf(c_448,negated_conjecture,
( ( sk3 != nil )
| ( app(cons(sk5,nil),sk6) != sk3 ) ),
inference(cnf_transformation,[],[f230]) ).
tcf(c_557,negated_conjecture,
ssList(sk6),
inference(global_subsumption_just,[status(thm)],[c_443,c_443,c_446,c_440]) ).
tcf(c_559,negated_conjecture,
ssItem(sk5),
inference(global_subsumption_just,[status(thm)],[c_441,c_441,c_442,c_440]) ).
tcf(c_567,negated_conjecture,
ssList(sk6),
inference(global_subsumption_just,[status(thm)],[c_446,c_557]) ).
tcf(c_569,negated_conjecture,
ssItem(sk5),
inference(global_subsumption_just,[status(thm)],[c_442,c_559]) ).
tcf(c_577,negated_conjecture,
app(sk6,cons(sk5,nil)) = sk4,
inference(global_subsumption_just,[status(thm)],[c_444,c_440,c_444,c_447]) ).
tcf(c_579,negated_conjecture,
app(sk6,cons(sk5,nil)) = sk4,
inference(global_subsumption_just,[status(thm)],[c_447,c_577]) ).
tcf(c_581,negated_conjecture,
app(cons(sk5,nil),sk6) != sk3,
inference(global_subsumption_just,[status(thm)],[c_445,c_440,c_445,c_448]) ).
tcf(c_583,negated_conjecture,
app(cons(sk5,nil),sk6) != sk3,
inference(global_subsumption_just,[status(thm)],[c_448,c_581]) ).
tcf(c_6505,definition,
iPr_def_12 = cons(sk5,nil),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_6506,definition,
iPr_def_13 = app(iPr_def_12,sk6),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_6507,definition,
iPr_def_14 = app(sk6,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_6508,negated_conjecture,
iPr_def_13 != sk3,
inference(demodulation,[status(thm)],[c_583,c_6505,c_6506]) ).
tcf(c_6509,negated_conjecture,
iPr_def_14 = sk4,
inference(demodulation,[status(thm)],[c_579,c_6507]) ).
tcf(c_6510,negated_conjecture,
ssItem(sk5),
inference(demodulation,[status(thm)],[c_569]) ).
tcf(c_6511,negated_conjecture,
ssList(sk6),
inference(demodulation,[status(thm)],[c_567]) ).
tcf(c_6513,negated_conjecture,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = sk3 )
| ~ ssItem(X1)
| ~ ssList(X0)
| ( app(X0,cons(X1,nil)) != sk4 ) ),
inference(demodulation,[status(thm)],[c_439]) ).
tcf(c_9044,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = sk3 )
| ~ ssItem(X1)
| ~ ssList(X0)
| ( app(X0,cons(X1,nil)) != iPr_def_14 ) ),
inference(light_normalisation,[status(thm)],[c_6513,c_6509]) ).
tcf(c_9061,plain,
! [X0: $i] :
( ( app(cons(sk5,nil),X0) = sk3 )
| ~ ssItem(sk5)
| ~ ssList(X0)
| ( app(X0,iPr_def_12) != iPr_def_14 ) ),
inference(superposition,[status(thm)],[c_6505,c_9044]) ).
tcf(c_9062,plain,
! [X0: $i] :
( ( app(iPr_def_12,X0) = sk3 )
| ~ ssItem(sk5)
| ~ ssList(X0)
| ( app(X0,iPr_def_12) != iPr_def_14 ) ),
inference(light_normalisation,[status(thm)],[c_9061,c_6505]) ).
tcf(c_9063,plain,
! [X0: $i] :
( ( app(iPr_def_12,X0) = sk3 )
| ~ ssList(X0)
| ( app(X0,iPr_def_12) != iPr_def_14 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_9062,c_6510]) ).
tcf(c_9074,plain,
( ( app(iPr_def_12,sk6) = sk3 )
| ~ ssList(sk6) ),
inference(superposition,[status(thm)],[c_6507,c_9063]) ).
tcf(c_9075,plain,
( ( sk3 = iPr_def_13 )
| ~ ssList(sk6) ),
inference(light_normalisation,[status(thm)],[c_9074,c_6506]) ).
tcf(c_9076,plain,
sk3 = iPr_def_13,
inference(forward_subsumption_resolution,[status(thm)],[c_9075,c_6511]) ).
tcf(c_9080,plain,
iPr_def_13 != iPr_def_13,
inference(demodulation,[status(thm)],[c_6508,c_9076]) ).
tcf(c_9082,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_9080]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC322-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.05/10.53 % Computer : n012.cluster.edu
% 0.05/10.53 % Model : x86_64 x86_64
% 0.05/10.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/10.53 % Memory : 8046.5625MB
% 0.05/10.53 % OS : Linux 6.8.0-71-generic
% 0.05/10.53 % CPULimit : 300
% 0.05/10.53 % WCLimit : 300
% 0.05/10.53 % DateTime : Thu Sep 24 17:37:19 UTC 2026
% 0.05/10.53 % CPUTime :
% 0.05/10.53 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.05/10.55 Running first-order theorem proving
% 0.05/10.55 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.05/10.56
% 0.05/10.56 % ======== iProver multi-core TPTP/SMT =========
% 0.05/10.56
% 0.05/10.56 % Detected problem language: tptp
% 0.05/10.57 % Proving...
% 1.87/11.19 % SZS status Started for theBenchmark.p
% 1.87/11.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.87/11.19
% 1.87/11.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.87/11.19
% 1.87/11.19 % ------ iProver source info
% 1.87/11.19
% 1.87/11.19 % git: date: 2026-07-19 20:42:38 +0200
% 1.87/11.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.87/11.19 % git: non_committed_changes: false
% 1.87/11.19
% 1.87/11.19 % ------ Parsing...% successful
% 1.87/11.19
% 1.87/11.19
% 1.87/11.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.87/11.19
% 1.87/11.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.87/11.19
% 1.87/11.19 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.87/11.19
% 1.87/11.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.87/11.19 % ------ Proving...
% 1.87/11.19 % ------ Problem Properties
% 1.87/11.19
% 1.87/11.19 %
% 1.87/11.19 % clauses 188
% 1.87/11.19 % conjectures 8
% 1.87/11.19 % EPR 59
% 1.87/11.19 % Horn 160
% 1.87/11.19 % unary 67
% 1.87/11.19 % binary 22
% 1.87/11.19 % lits 556
% 1.87/11.19 % lits eq 78
% 1.87/11.19 % fd_pure 0
% 1.87/11.19 % fd_pseudo 0
% 1.87/11.19 % fd_cond 15
% 1.87/11.19 % fd_pseudo_cond 14
% 1.87/11.19 % AC symbols 0
% 1.87/11.19
% 1.87/11.19 % ------ Schedule dynamic 5 is on
% 1.87/11.19
% 1.87/11.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.87/11.19
% 1.87/11.19
% 1.87/11.19 % ------
% 1.87/11.19 % Current options:
% 1.87/11.19 % ------
% 1.87/11.19
% 1.87/11.19
% 1.87/11.19 %
% 1.87/11.19
% 1.87/11.19 % ------ Proving...
% 1.87/11.19 %
% 1.87/11.19
% 1.87/11.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.87/11.19
% 1.87/11.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.87/11.19
% 1.87/11.19
%------------------------------------------------------------------------------