%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC372-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 : n015.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:30 PM UTC 2026
% Result : Unsatisfiable 4.35s 6.30s
% Output : CNFRefutation 4.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 29 ( 16 unt; 0 def)
% Number of atoms : 62 ( 9 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 69 ( 36 ~; 33 |; 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 21 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
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/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
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,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,plain,
sk4 = app(sk3,sk5),
inference(reorient_equations,[],[f207]) ).
fof(f212,negated_conjecture,
~ segmentP(sk2,sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f216,plain,
~ segmentP(sk4,sk3),
inference(definition_unfolding,[],[f212,f204,f205]) ).
fof(f222,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_248,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_250,negated_conjecture,
ssList(sk5),
inference(cnf_transformation,[],[f206]) ).
tcf(c_251,negated_conjecture,
app(sk3,sk5) = sk4,
inference(cnf_transformation,[],[f208]) ).
tcf(c_254,negated_conjecture,
~ segmentP(sk4,sk3),
inference(cnf_transformation,[],[f216]) ).
tcf(c_264,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_265,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f74]) ).
tcf(c_275,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_288,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,[],[f222]) ).
tcf(c_3014,plain,
app(nil,sk3) = sk3,
inference(superposition,[status(thm)],[c_248,c_265]) ).
tcf(c_5555,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_3014,c_288]) ).
tcf(c_5617,plain,
! [X0: $i] :
( segmentP(app(sk3,X0),sk3)
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(X0)
| ~ ssList(app(sk3,X0)) ),
inference(light_normalisation,[status(thm)],[c_5555,c_3014]) ).
tcf(c_5618,plain,
! [X0: $i] :
( segmentP(app(sk3,X0),sk3)
| ~ ssList(X0)
| ~ ssList(app(sk3,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5617,c_275,c_248]) ).
tcf(c_6168,plain,
! [X0: $i] :
( ssList(app(sk3,X0))
| ~ ssList(sk3)
| ~ ssList(X0) ),
inference(instantiation,[status(thm)],[c_264]) ).
tcf(c_7133,plain,
! [X0: $i] :
( segmentP(app(sk3,X0),sk3)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_5618,c_248,c_5618,c_6168]) ).
tcf(c_7140,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk5) ),
inference(superposition,[status(thm)],[c_251,c_7133]) ).
tcf(c_7145,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7140,c_254,c_250]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC372-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.11/5.38 % Computer : n015.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Thu Sep 24 17:57:31 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/5.42 Running first-order theorem proving
% 0.16/5.42 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.16/5.43
% 0.16/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.16/5.43
% 0.16/5.43 % Detected problem language: tptp
% 0.16/5.45 % Proving...
% 4.35/6.30 % SZS status Started for theBenchmark.p
% 4.35/6.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.35/6.30
% 4.35/6.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.35/6.30
% 4.35/6.30 % ------ iProver source info
% 4.35/6.30
% 4.35/6.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.35/6.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.35/6.30 % git: non_committed_changes: false
% 4.35/6.30
% 4.35/6.30 % ------ Parsing...% successful
% 4.35/6.30
% 4.35/6.30
% 4.35/6.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.35/6.30
% 4.35/6.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.35/6.30
% 4.35/6.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.35/6.30
% 4.35/6.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.35/6.30 % ------ Proving...
% 4.35/6.30 % ------ Problem Properties
% 4.35/6.30
% 4.35/6.30 %
% 4.35/6.30 % clauses 57
% 4.35/6.30 % conjectures 8
% 4.35/6.30 % EPR 24
% 4.35/6.30 % Horn 48
% 4.35/6.30 % unary 11
% 4.35/6.30 % binary 9
% 4.35/6.30 % lits 208
% 4.35/6.30 % lits eq 39
% 4.35/6.30 % fd_pure 0
% 4.35/6.30 % fd_pseudo 0
% 4.35/6.30 % fd_cond 11
% 4.35/6.30 % fd_pseudo_cond 7
% 4.35/6.30 % AC symbols 0
% 4.35/6.30
% 4.35/6.30 % ------ Schedule dynamic 5 is on
% 4.35/6.30
% 4.35/6.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.35/6.30
% 4.35/6.30
% 4.35/6.30 % ------
% 4.35/6.30 % Current options:
% 4.35/6.30 % ------
% 4.35/6.30
% 4.35/6.30
% 4.35/6.30 %
% 4.35/6.30
% 4.35/6.30 % ------ Proving...
% 4.35/6.30 %
% 4.35/6.30
% 4.35/6.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.35/6.30
% 4.35/6.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.35/6.30
% 4.35/6.30
%------------------------------------------------------------------------------