%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC320-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 : n020.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:17 PM UTC 2026
% Result : Unsatisfiable 3.41s 1.15s
% Output : CNFRefutation 3.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of formulae : 52 ( 16 unt; 3 def)
% Number of atoms : 151 ( 68 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 166 ( 89 ~; 77 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 31 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
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(f206,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f210,plain,
( ~ neq(sk4,nil)
| sk3 = app(cons(sk5,nil),sk6) ),
inference(reorient_equations,[],[f209]) ).
fof(f211,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f212,plain,
( ~ neq(sk4,nil)
| sk4 = app(sk6,cons(sk5,nil)) ),
inference(reorient_equations,[],[f211]) ).
fof(f213,negated_conjecture,
( neq(sk2,nil)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f214,negated_conjecture,
! [X0,X1] :
( app(X1,cons(X0,nil)) != sk2
| app(cons(X0,nil),X1) != sk1
| ~ ssList(X1)
| ~ ssItem(X0)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f215,plain,
! [X0,X1] :
( sk2 != app(X1,cons(X0,nil))
| app(cons(X0,nil),X1) != sk1
| ~ ssList(X1)
| ~ ssItem(X0)
| nil = sk2 ),
inference(reorient_equations,[],[f214]) ).
fof(f216,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f217,negated_conjecture,
! [X0,X1] :
( app(X1,cons(X0,nil)) != sk2
| app(cons(X0,nil),X1) != sk1
| ~ ssList(X1)
| ~ ssItem(X0)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f218,plain,
! [X0,X1] :
( sk2 != app(X1,cons(X0,nil))
| app(cons(X0,nil),X1) != sk1
| ~ ssList(X1)
| ~ ssItem(X0)
| nil != sk1 ),
inference(reorient_equations,[],[f217]) ).
fof(f221,plain,
( neq(sk4,nil)
| nil = sk4 ),
inference(definition_unfolding,[],[f213,f204,f204]) ).
fof(f222,plain,
! [X0,X1] :
( sk4 != app(X1,cons(X0,nil))
| app(cons(X0,nil),X1) != sk3
| ~ ssList(X1)
| ~ ssItem(X0)
| nil = sk4 ),
inference(definition_unfolding,[],[f215,f204,f205,f204]) ).
fof(f223,plain,
( neq(sk4,nil)
| nil != sk3 ),
inference(definition_unfolding,[],[f216,f205,f204]) ).
fof(f224,plain,
! [X0,X1] :
( sk4 != app(X1,cons(X0,nil))
| app(cons(X0,nil),X1) != sk3
| ~ ssList(X1)
| ~ ssItem(X0)
| nil != sk3 ),
inference(definition_unfolding,[],[f218,f205,f205,f204]) ).
tcf(c_438,negated_conjecture,
( ( sk3 = nil )
| ( sk4 != nil ) ),
inference(cnf_transformation,[],[f206]) ).
tcf(c_439,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f207]) ).
tcf(c_440,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f208]) ).
tcf(c_441,negated_conjecture,
( ( app(cons(sk5,nil),sk6) = sk3 )
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f210]) ).
tcf(c_442,negated_conjecture,
( ( app(sk6,cons(sk5,nil)) = sk4 )
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f212]) ).
tcf(c_443,negated_conjecture,
( neq(sk4,nil)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_444,negated_conjecture,
! [X0: $i,X1: $i] :
( ( sk4 = nil )
| ~ ssItem(X0)
| ~ ssList(X1)
| ( app(X1,cons(X0,nil)) != sk4 )
| ( app(cons(X0,nil),X1) != sk3 ) ),
inference(cnf_transformation,[],[f222]) ).
tcf(c_445,negated_conjecture,
( neq(sk4,nil)
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f223]) ).
tcf(c_446,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( sk3 != nil )
| ( app(X1,cons(X0,nil)) != sk4 )
| ( app(cons(X0,nil),X1) != sk3 ) ),
inference(cnf_transformation,[],[f224]) ).
tcf(c_556,negated_conjecture,
ssList(sk6),
inference(global_subsumption_just,[status(thm)],[c_440,c_440,c_443,c_445,c_438]) ).
tcf(c_558,negated_conjecture,
ssItem(sk5),
inference(global_subsumption_just,[status(thm)],[c_439,c_439,c_443,c_445,c_438]) ).
tcf(c_566,negated_conjecture,
neq(sk4,nil),
inference(global_subsumption_just,[status(thm)],[c_443,c_443,c_445,c_438]) ).
tcf(c_576,negated_conjecture,
app(sk6,cons(sk5,nil)) = sk4,
inference(global_subsumption_just,[status(thm)],[c_442,c_443,c_445,c_438,c_442]) ).
tcf(c_578,negated_conjecture,
app(cons(sk5,nil),sk6) = sk3,
inference(global_subsumption_just,[status(thm)],[c_441,c_441,c_566]) ).
tcf(c_580,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X0,nil),X1) != sk3 )
| ( app(X1,cons(X0,nil)) != sk4 )
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(global_subsumption_just,[status(thm)],[c_444,c_438,c_444,c_446]) ).
tcf(c_581,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( app(X1,cons(X0,nil)) != sk4 )
| ( app(cons(X0,nil),X1) != sk3 ) ),
inference(renaming,[status(thm)],[c_580]) ).
tcf(c_583,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( app(cons(X0,nil),X1) != sk3 )
| ( app(X1,cons(X0,nil)) != sk4 ) ),
inference(global_subsumption_just,[status(thm)],[c_446,c_581]) ).
tcf(c_584,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( app(X1,cons(X0,nil)) != sk4 )
| ( app(cons(X0,nil),X1) != sk3 ) ),
inference(renaming,[status(thm)],[c_583]) ).
tcf(c_6518,definition,
iPr_def_12 = cons(sk5,nil),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_6519,definition,
iPr_def_13 = app(iPr_def_12,sk6),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_6520,definition,
iPr_def_14 = app(sk6,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_6522,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( app(X1,cons(X0,nil)) != sk4 )
| ( app(cons(X0,nil),X1) != sk3 ) ),
inference(demodulation,[status(thm)],[c_584]) ).
tcf(c_6523,negated_conjecture,
iPr_def_13 = sk3,
inference(demodulation,[status(thm)],[c_578,c_6518,c_6519]) ).
tcf(c_6524,negated_conjecture,
iPr_def_14 = sk4,
inference(demodulation,[status(thm)],[c_576,c_6520]) ).
tcf(c_6525,negated_conjecture,
ssItem(sk5),
inference(demodulation,[status(thm)],[c_558]) ).
tcf(c_6526,negated_conjecture,
ssList(sk6),
inference(demodulation,[status(thm)],[c_556]) ).
tcf(c_9051,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( app(X1,cons(X0,nil)) != iPr_def_14 )
| ( app(cons(X0,nil),X1) != iPr_def_13 ) ),
inference(light_normalisation,[status(thm)],[c_6522,c_6523,c_6524]) ).
tcf(c_9061,plain,
! [X0: $i] :
( ~ ssItem(sk5)
| ~ ssList(X0)
| ( app(iPr_def_12,X0) != iPr_def_13 )
| ( app(X0,cons(sk5,nil)) != iPr_def_14 ) ),
inference(superposition,[status(thm)],[c_6518,c_9051]) ).
tcf(c_9062,plain,
! [X0: $i] :
( ~ ssItem(sk5)
| ~ ssList(X0)
| ( app(iPr_def_12,X0) != iPr_def_13 )
| ( app(X0,iPr_def_12) != iPr_def_14 ) ),
inference(light_normalisation,[status(thm)],[c_9061,c_6518]) ).
tcf(c_9063,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( app(iPr_def_12,X0) != iPr_def_13 )
| ( app(X0,iPr_def_12) != iPr_def_14 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_9062,c_6525]) ).
tcf(c_9074,plain,
( ~ ssList(sk6)
| ( app(sk6,iPr_def_12) != iPr_def_14 ) ),
inference(superposition,[status(thm)],[c_6519,c_9063]) ).
tcf(c_9075,plain,
~ ssList(sk6),
inference(ground_joinability,[status(thm)],[c_9074,c_6520]) ).
tcf(c_9076,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_9075,c_6526]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC320-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.08/0.35 % Computer : n020.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 17:37:35 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 3.41/1.15 % SZS status Started for theBenchmark.p
% 3.41/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.41/1.15
% 3.41/1.15 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.41/1.15
% 3.41/1.15 % ------ iProver source info
% 3.41/1.15
% 3.41/1.15 % git: date: 2026-07-19 20:42:38 +0200
% 3.41/1.15 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.41/1.15 % git: non_committed_changes: false
% 3.41/1.15
% 3.41/1.15 % ------ Parsing...% successful
% 3.41/1.15
% 3.41/1.15
% 3.41/1.15 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.41/1.15
% 3.41/1.15 % ------ 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.41/1.15
% 3.41/1.15 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.41/1.15
% 3.41/1.15 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.41/1.15 % ------ Proving...
% 3.41/1.15 % ------ Problem Properties
% 3.41/1.15
% 3.41/1.15 %
% 3.41/1.15 % clauses 188
% 3.41/1.15 % conjectures 7
% 3.41/1.15 % EPR 59
% 3.41/1.15 % Horn 160
% 3.41/1.15 % unary 68
% 3.41/1.15 % binary 21
% 3.41/1.15 % lits 555
% 3.41/1.15 % lits eq 77
% 3.41/1.15 % fd_pure 0
% 3.41/1.15 % fd_pseudo 0
% 3.41/1.15 % fd_cond 15
% 3.41/1.15 % fd_pseudo_cond 14
% 3.41/1.15 % AC symbols 0
% 3.41/1.15
% 3.41/1.15 % ------ Schedule dynamic 5 is on
% 3.41/1.15
% 3.41/1.15 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.41/1.15
% 3.41/1.15
% 3.41/1.15 % ------
% 3.41/1.15 % Current options:
% 3.41/1.15 % ------
% 3.41/1.15
% 3.41/1.15
% 3.41/1.15 %
% 3.41/1.15
% 3.41/1.15 % ------ Proving...
% 3.41/1.15 %
% 3.41/1.15
% 3.41/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.41/1.15
% 3.41/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.41/1.15
% 3.41/1.15
%------------------------------------------------------------------------------