%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC070-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 : 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:07:45 PM UTC 2026
% Result : Unsatisfiable 1.39s 1.75s
% Output : CNFRefutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of formulae : 56 ( 21 unt; 0 def)
% Number of atoms : 125 ( 26 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 143 ( 74 ~; 69 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 29 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f51,axiom,
! [X0,X1] : ssList(skaf45(X0,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
fof(f57,axiom,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
fof(f143,axiom,
! [X0,X1] :
( app(X1,skaf45(X0,X1)) = X0
| ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
fof(f187,axiom,
! [X2,X3,X0,X1] :
( segmentP(X3,X1)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| app(app(X0,X1),X2) != X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
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] :
( ~ segmentP(sk1,X0)
| ~ segmentP(sk2,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( neq(sk3,nil)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( frontsegP(sk4,sk3)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( neq(sk3,nil)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
( frontsegP(sk4,sk3)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f214,plain,
! [X0] :
( ~ segmentP(sk3,X0)
| ~ segmentP(sk4,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f206,f204,f205]) ).
fof(f215,plain,
( nil != sk3
| nil != sk4 ),
inference(definition_unfolding,[],[f207,f204,f205]) ).
fof(f230,plain,
! [X2,X0,X1] :
( segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(equality_resolution,[],[f187]) ).
tcf(c_253,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_296,plain,
! [X0: $i,X1: $i] : ssList(skaf45(X0,X1)),
inference(cnf_transformation,[],[f51]) ).
tcf(c_302,plain,
! [X0: $i] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_319,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f74]) ).
tcf(c_377,plain,
! [X0: $i,X1: $i] :
( ( app(X1,skaf45(X0,X1)) = X0 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f143]) ).
tcf(c_418,plain,
! [X0: $i,X1: $i,X2: $i] :
( segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(app(X0,X1),X2)) ),
inference(cnf_transformation,[],[f230]) ).
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,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f214]) ).
tcf(c_436,negated_conjecture,
( ( sk4 != nil )
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_437,negated_conjecture,
( neq(sk3,nil)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f208]) ).
tcf(c_438,negated_conjecture,
( frontsegP(sk4,sk3)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_439,negated_conjecture,
( neq(sk3,nil)
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f210]) ).
tcf(c_440,negated_conjecture,
( frontsegP(sk4,sk3)
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f211]) ).
tcf(c_554,negated_conjecture,
frontsegP(sk4,sk3),
inference(global_subsumption_just,[status(thm)],[c_440,c_440,c_438,c_436]) ).
tcf(c_556,negated_conjecture,
neq(sk3,nil),
inference(global_subsumption_just,[status(thm)],[c_439,c_439,c_437,c_436]) ).
tcf(c_558,negated_conjecture,
frontsegP(sk4,sk3),
inference(global_subsumption_just,[status(thm)],[c_438,c_554]) ).
tcf(c_560,negated_conjecture,
neq(sk3,nil),
inference(global_subsumption_just,[status(thm)],[c_437,c_556]) ).
tcf(c_2970,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0)
| ( nil != nil )
| ( X0 != sk3 ) ),
inference(resolution_lifted,[status(thm)],[c_435,c_560]) ).
tcf(c_2971,plain,
( ~ ssList(sk3)
| ~ segmentP(sk4,sk3)
| ~ segmentP(sk3,sk3) ),
inference(unflattening,[status(thm)],[c_2970]) ).
tcf(c_2972,plain,
( ~ segmentP(sk3,sk3)
| ~ segmentP(sk4,sk3) ),
inference(global_subsumption_just,[status(thm)],[c_2971,c_433,c_2971]) ).
tcf(c_2973,plain,
( ~ segmentP(sk4,sk3)
| ~ segmentP(sk3,sk3) ),
inference(renaming,[status(thm)],[c_2972]) ).
tcf(c_6553,plain,
( ~ segmentP(sk4,sk3)
| ~ segmentP(sk3,sk3) ),
inference(demodulation,[status(thm)],[c_2973]) ).
tcf(c_6554,negated_conjecture,
frontsegP(sk4,sk3),
inference(demodulation,[status(thm)],[c_558]) ).
tcf(c_6555,negated_conjecture,
ssList(sk4),
inference(demodulation,[status(thm)],[c_434]) ).
tcf(c_6556,negated_conjecture,
ssList(sk3),
inference(demodulation,[status(thm)],[c_433]) ).
tcf(c_9100,plain,
( ~ ssList(sk3)
| ~ segmentP(sk4,sk3) ),
inference(superposition,[status(thm)],[c_302,c_6553]) ).
tcf(c_9101,plain,
~ segmentP(sk4,sk3),
inference(forward_subsumption_resolution,[status(thm)],[c_9100,c_6556]) ).
tcf(c_9362,plain,
app(nil,sk3) = sk3,
inference(superposition,[status(thm)],[c_6556,c_319]) ).
tcf(c_12467,plain,
( ( app(sk3,skaf45(sk4,sk3)) = sk4 )
| ~ ssList(sk4)
| ~ ssList(sk3) ),
inference(superposition,[status(thm)],[c_6554,c_377]) ).
tcf(c_12505,plain,
app(sk3,skaf45(sk4,sk3)) = sk4,
inference(forward_subsumption_resolution,[status(thm)],[c_12467,c_6555,c_6556]) ).
tcf(c_18876,plain,
! [X0: $i] :
( segmentP(app(sk3,X0),sk3)
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(X0)
| ~ ssList(app(app(nil,sk3),X0)) ),
inference(superposition,[status(thm)],[c_9362,c_418]) ).
tcf(c_18896,plain,
! [X0: $i] :
( segmentP(app(sk3,X0),sk3)
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(X0)
| ~ ssList(app(sk3,X0)) ),
inference(light_normalisation,[status(thm)],[c_18876,c_9362]) ).
tcf(c_18897,plain,
! [X0: $i] :
( segmentP(app(sk3,X0),sk3)
| ~ ssList(X0)
| ~ ssList(app(sk3,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_18896,c_253,c_6556]) ).
tcf(c_19375,plain,
( segmentP(sk4,sk3)
| ~ ssList(skaf45(sk4,sk3))
| ~ ssList(app(sk3,skaf45(sk4,sk3))) ),
inference(superposition,[status(thm)],[c_12505,c_18897]) ).
tcf(c_19381,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk4)
| ~ ssList(skaf45(sk4,sk3)) ),
inference(light_normalisation,[status(thm)],[c_19375,c_12505]) ).
tcf(c_19382,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_19381,c_9101,c_6555,c_296]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC070-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/0.38 % Computer : n020.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 16:14:49 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 1.39/1.75 % SZS status Started for theBenchmark.p
% 1.39/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 1.39/1.75
% 1.39/1.75 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.39/1.75
% 1.39/1.75 % ------ iProver source info
% 1.39/1.75
% 1.39/1.75 % git: date: 2026-07-19 20:42:38 +0200
% 1.39/1.75 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.39/1.75 % git: non_committed_changes: false
% 1.39/1.75
% 1.39/1.75 % ------ Parsing...% successful
% 1.39/1.75
% 1.39/1.75
% 1.39/1.75 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.39/1.75
% 1.39/1.75 % ------ 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 %
% 1.39/1.75
% 1.39/1.75 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.39/1.75
% 1.39/1.75 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.39/1.75 % ------ Proving...
% 1.39/1.75 % ------ Problem Properties
% 1.39/1.75
% 1.39/1.75 %
% 1.39/1.75 % clauses 183
% 1.39/1.75 % conjectures 3
% 1.39/1.75 % EPR 58
% 1.39/1.75 % Horn 155
% 1.39/1.75 % unary 62
% 1.39/1.75 % binary 22
% 1.39/1.75 % lits 551
% 1.39/1.75 % lits eq 71
% 1.39/1.75 % fd_pure 0
% 1.39/1.75 % fd_pseudo 0
% 1.39/1.75 % fd_cond 16
% 1.39/1.75 % fd_pseudo_cond 14
% 1.39/1.75 % AC symbols 0
% 1.39/1.75
% 1.39/1.75 % ------ Schedule dynamic 5 is on
% 1.39/1.75
% 1.39/1.75 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.39/1.75
% 1.39/1.75
% 1.39/1.75 % ------
% 1.39/1.75 % Current options:
% 1.39/1.75 % ------
% 1.39/1.75
% 1.39/1.75
% 1.39/1.75 %
% 1.39/1.75
% 1.39/1.75 % ------ Proving...
% 1.39/1.75 %
% 1.39/1.75
% 1.39/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 1.39/1.75
% 1.39/1.75 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.39/1.76
% 1.39/1.76
%------------------------------------------------------------------------------