%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC349+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 : n008.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:24 PM UTC 2026
% Result : Theorem 3.26s 1.27s
% Output : CNFRefutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 21 ( 11 unt; 0 def)
% Number of atoms : 66 ( 18 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 65 ( 20 ~; 12 |; 24 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 21 ( 0 sgn 13 !; 8 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
fof(f45,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax45) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( frontsegP(X1,X0)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( frontsegP(X1,X0)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ frontsegP(X1,X0)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& nil = X2 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ frontsegP(X1,X0)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& nil = X2 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f106,plain,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,nil) ),
inference(ennf_transformation,[],[f45]) ).
fof(f131,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ~ frontsegP(sK1,sK0)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& nil = sK2 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f99]) ).
fof(f145,plain,
ssList(sK1),
inference(cnf_transformation,[],[f131]) ).
fof(f148,plain,
~ frontsegP(sK1,sK0),
inference(cnf_transformation,[],[f131]) ).
fof(f150,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f131]) ).
fof(f151,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f131]) ).
fof(f152,plain,
nil = sK2,
inference(cnf_transformation,[],[f131]) ).
fof(f167,plain,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,nil) ),
inference(cnf_transformation,[],[f106]) ).
fof(f194,plain,
~ frontsegP(sK3,sK2),
inference(definition_unfolding,[],[f148,f151,f150]) ).
fof(f195,plain,
ssList(sK3),
inference(definition_unfolding,[],[f145,f151]) ).
fof(f204,plain,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,sK2) ),
inference(definition_unfolding,[],[f167,f152]) ).
tcf(c_50,negated_conjecture,
~ frontsegP(sK3,sK2),
inference(cnf_transformation,[],[f194]) ).
tcf(c_53,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f195]) ).
tcf(c_69,negated_conjecture,
! [X0: $i] :
( frontsegP(X0,sK2)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f204]) ).
tcf(c_1784,plain,
~ ssList(sK3),
inference(superposition,[status(thm)],[c_69,c_50]) ).
tcf(c_1785,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1784,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC349+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.07/0.35 % Computer : n008.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Thu Sep 24 17:46:39 UTC 2026
% 0.07/0.36 % CPUTime :
% 0.07/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.12/0.41
% 0.12/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41
% 0.12/0.41 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 3.26/1.27 % SZS status Started for theBenchmark.p
% 3.26/1.27 % SZS status Theorem for theBenchmark.p
% 3.26/1.27
% 3.26/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.26/1.27
% 3.26/1.27 % ------ iProver source info
% 3.26/1.27
% 3.26/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 3.26/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.26/1.27 % git: non_committed_changes: false
% 3.26/1.27
% 3.26/1.27 % ------ Parsing...
% 3.26/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.26/1.27
% 3.26/1.27 % ------ 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.26/1.27
% 3.26/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.26/1.27
% 3.26/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.26/1.27 % ------ Proving...
% 3.26/1.27 % ------ Problem Properties
% 3.26/1.27
% 3.26/1.27 %
% 3.26/1.27 % clauses 39
% 3.26/1.27 % conjectures 16
% 3.26/1.27 % EPR 13
% 3.26/1.27 % Horn 36
% 3.26/1.27 % unary 9
% 3.26/1.27 % binary 4
% 3.26/1.27 % lits 126
% 3.26/1.27 % lits eq 30
% 3.26/1.27 % fd_pure 0
% 3.26/1.27 % fd_pseudo 0
% 3.26/1.27 % fd_cond 5
% 3.26/1.27 % fd_pseudo_cond 6
% 3.26/1.27 % AC symbols 0
% 3.26/1.27
% 3.26/1.27 % ------ Schedule dynamic 5 is on
% 3.26/1.27
% 3.26/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.26/1.27
% 3.26/1.27
% 3.26/1.27 % ------
% 3.26/1.27 % Current options:
% 3.26/1.27 % ------
% 3.26/1.27
% 3.26/1.27
% 3.26/1.27 %
% 3.26/1.27
% 3.26/1.27 % ------ Proving...
% 3.26/1.27 %
% 3.26/1.27
% 3.26/1.27 % SZS status Theorem for theBenchmark.p
% 3.26/1.27
% 3.26/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.26/1.27
% 3.26/1.27
%------------------------------------------------------------------------------