%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC122-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 : n019.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:59 PM UTC 2026
% Result : Unsatisfiable 1.45s 2.16s
% Output : CNFRefutation 1.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 42 ( 22 unt; 0 def)
% Number of atoms : 86 ( 10 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 93 ( 49 ~; 44 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 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 : 23 ( 0 sgn 23 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f50,axiom,
! [X0,X1] : ssList(skaf46(X0,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause50) ).
fof(f73,axiom,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
fof(f142,axiom,
! [X0,X1] :
( app(skaf46(X0,X1),X1) = X0
| ~ ssList(X0)
| ~ ssList(X1)
| ~ rearsegP(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause131) ).
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,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f208,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( rearsegP(sk4,sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f213,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f206,f204]) ).
fof(f214,plain,
( ~ segmentP(sk4,sk3)
| ~ neq(sk3,nil) ),
inference(definition_unfolding,[],[f208,f205,f204,f205]) ).
fof(f229,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_252,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_294,plain,
! [X0: $i,X1: $i] : ssList(skaf46(X0,X1)),
inference(cnf_transformation,[],[f50]) ).
tcf(c_317,plain,
! [X0: $i] :
( ( app(X0,nil) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f73]) ).
tcf(c_375,plain,
! [X0: $i,X1: $i] :
( ( app(skaf46(X0,X1),X1) = X0 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ rearsegP(X0,X1) ),
inference(cnf_transformation,[],[f142]) ).
tcf(c_417,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,[],[f229]) ).
tcf(c_432,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_433,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_434,negated_conjecture,
neq(sk4,nil),
inference(cnf_transformation,[],[f213]) ).
tcf(c_436,negated_conjecture,
( ~ segmentP(sk4,sk3)
| ~ neq(sk3,nil) ),
inference(cnf_transformation,[],[f214]) ).
tcf(c_437,negated_conjecture,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_438,negated_conjecture,
( rearsegP(sk4,sk3)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f210]) ).
tcf(c_552,negated_conjecture,
rearsegP(sk4,sk3),
inference(global_subsumption_just,[status(thm)],[c_438,c_434,c_438]) ).
tcf(c_556,negated_conjecture,
~ segmentP(sk4,sk3),
inference(global_subsumption_just,[status(thm)],[c_436,c_434,c_437,c_436]) ).
tcf(c_6479,negated_conjecture,
~ segmentP(sk4,sk3),
inference(demodulation,[status(thm)],[c_556]) ).
tcf(c_6480,negated_conjecture,
rearsegP(sk4,sk3),
inference(demodulation,[status(thm)],[c_552]) ).
tcf(c_6481,negated_conjecture,
ssList(sk4),
inference(demodulation,[status(thm)],[c_433]) ).
tcf(c_6482,negated_conjecture,
ssList(sk3),
inference(demodulation,[status(thm)],[c_432]) ).
tcf(c_9025,plain,
app(sk4,nil) = sk4,
inference(superposition,[status(thm)],[c_6481,c_317]) ).
tcf(c_12131,plain,
( ( app(skaf46(sk4,sk3),sk3) = sk4 )
| ~ ssList(sk4)
| ~ ssList(sk3) ),
inference(superposition,[status(thm)],[c_6480,c_375]) ).
tcf(c_12170,plain,
app(skaf46(sk4,sk3),sk3) = sk4,
inference(forward_subsumption_resolution,[status(thm)],[c_12131,c_6481,c_6482]) ).
tcf(c_18324,plain,
! [X0: $i] :
( segmentP(app(sk4,X0),sk3)
| ~ ssList(sk3)
| ~ ssList(X0)
| ~ ssList(skaf46(sk4,sk3))
| ~ ssList(app(app(skaf46(sk4,sk3),sk3),X0)) ),
inference(superposition,[status(thm)],[c_12170,c_417]) ).
tcf(c_18458,plain,
! [X0: $i] :
( segmentP(app(sk4,X0),sk3)
| ~ ssList(sk3)
| ~ ssList(X0)
| ~ ssList(skaf46(sk4,sk3))
| ~ ssList(app(sk4,X0)) ),
inference(light_normalisation,[status(thm)],[c_18324,c_12170]) ).
tcf(c_18459,plain,
! [X0: $i] :
( segmentP(app(sk4,X0),sk3)
| ~ ssList(X0)
| ~ ssList(app(sk4,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_18458,c_6482,c_294]) ).
tcf(c_19181,plain,
( segmentP(sk4,sk3)
| ~ ssList(nil)
| ~ ssList(app(sk4,nil)) ),
inference(superposition,[status(thm)],[c_9025,c_18459]) ).
tcf(c_19185,plain,
( segmentP(sk4,sk3)
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(light_normalisation,[status(thm)],[c_19181,c_9025]) ).
tcf(c_19186,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_19185,c_6479,c_252,c_6481]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC122-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.09/0.77 % Computer : n019.cluster.edu
% 0.09/0.77 % Model : x86_64 x86_64
% 0.09/0.77 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.77 % Memory : 8046.5625MB
% 0.09/0.77 % OS : Linux 6.8.0-71-generic
% 0.09/0.77 % CPULimit : 300
% 0.09/0.77 % WCLimit : 300
% 0.09/0.77 % DateTime : Thu Sep 24 16:31:06 UTC 2026
% 0.09/0.77 % CPUTime :
% 0.09/0.77 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.81 Running first-order theorem proving
% 0.13/0.81 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.13/0.82
% 0.13/0.82 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.82
% 0.13/0.82 % Detected problem language: tptp
% 0.13/0.84 % Proving...
% 1.45/2.16 % SZS status Started for theBenchmark.p
% 1.45/2.16 % SZS status Unsatisfiable for theBenchmark.p
% 1.45/2.16
% 1.45/2.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.45/2.16
% 1.45/2.16 % ------ iProver source info
% 1.45/2.16
% 1.45/2.16 % git: date: 2026-07-19 20:42:38 +0200
% 1.45/2.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.45/2.16 % git: non_committed_changes: false
% 1.45/2.16
% 1.45/2.16 % ------ Parsing...% successful
% 1.45/2.16
% 1.45/2.16
% 1.45/2.16 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.45/2.16
% 1.45/2.16 % ------ 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.45/2.16
% 1.45/2.16 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.45/2.16
% 1.45/2.16 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.45/2.16 % ------ Proving...
% 1.45/2.16 % ------ Problem Properties
% 1.45/2.16
% 1.45/2.16 %
% 1.45/2.16 % clauses 183
% 1.45/2.16 % conjectures 4
% 1.45/2.16 % EPR 58
% 1.45/2.16 % Horn 155
% 1.45/2.16 % unary 64
% 1.45/2.16 % binary 21
% 1.45/2.16 % lits 547
% 1.45/2.16 % lits eq 71
% 1.45/2.16 % fd_pure 0
% 1.45/2.16 % fd_pseudo 0
% 1.45/2.16 % fd_cond 15
% 1.45/2.16 % fd_pseudo_cond 14
% 1.45/2.16 % AC symbols 0
% 1.45/2.16
% 1.45/2.16 % ------ Schedule dynamic 5 is on
% 1.45/2.16
% 1.45/2.16 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.45/2.16
% 1.45/2.16
% 1.45/2.16 % ------
% 1.45/2.16 % Current options:
% 1.45/2.16 % ------
% 1.45/2.16
% 1.45/2.16
% 1.45/2.16 %
% 1.45/2.16
% 1.45/2.16 % ------ Proving...
% 1.45/2.16 %
% 1.45/2.16
% 1.45/2.16 % SZS status Unsatisfiable for theBenchmark.p
% 1.45/2.16
% 1.45/2.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.45/2.16
% 1.45/2.16
%------------------------------------------------------------------------------