%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC038+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 : n009.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:37 PM UTC 2026
% Result : Theorem 4.36s 6.57s
% Output : CNFRefutation 4.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 100 ( 48 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 105 ( 32 ~; 29 |; 33 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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 : 22 ( 0 sgn 14 !; 8 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
fof(f46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax46) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f105,plain,
! [X0] :
( ~ ssList(X0)
| ( frontsegP(nil,X0)
<=> nil = X0 ) ),
inference(ennf_transformation,[],[f46]) ).
fof(f131,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ( frontsegP(sK3,sK2)
& neq(sK2,nil) )
| ( nil = sK2
& nil = sK3 ) )
& nil != sK0
& sK0 = sK2
& sK1 = sK3
& nil = sK1 ),
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(f136,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ frontsegP(nil,X0)
| nil = X0 )
& ( nil != X0
| frontsegP(nil,X0) ) ) ),
inference(nnf_transformation,[],[f105]) ).
fof(f144,plain,
ssList(sK0),
inference(cnf_transformation,[],[f131]) ).
fof(f148,plain,
( frontsegP(sK3,sK2)
| nil = sK2 ),
inference(cnf_transformation,[],[f131]) ).
fof(f152,plain,
nil != sK0,
inference(cnf_transformation,[],[f131]) ).
fof(f153,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f131]) ).
fof(f154,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f131]) ).
fof(f155,plain,
nil = sK1,
inference(cnf_transformation,[],[f131]) ).
fof(f168,plain,
! [X0] :
( ~ ssList(X0)
| ~ frontsegP(nil,X0)
| nil = X0 ),
inference(cnf_transformation,[],[f136]) ).
fof(f196,plain,
nil = sK3,
inference(definition_unfolding,[],[f155,f154]) ).
fof(f197,plain,
sK2 != sK3,
inference(definition_unfolding,[],[f152,f196,f153]) ).
fof(f201,plain,
( frontsegP(sK3,sK2)
| sK2 = sK3 ),
inference(definition_unfolding,[],[f148,f196]) ).
fof(f203,plain,
ssList(sK2),
inference(definition_unfolding,[],[f144,f153]) ).
fof(f210,plain,
! [X0] :
( ~ ssList(X0)
| ~ frontsegP(sK3,X0)
| sK3 = X0 ),
inference(definition_unfolding,[],[f168,f196,f196]) ).
tcf(c_49,negated_conjecture,
sK2 != sK3,
inference(cnf_transformation,[],[f197]) ).
tcf(c_51,negated_conjecture,
( frontsegP(sK3,sK2)
| ( sK2 = sK3 ) ),
inference(cnf_transformation,[],[f201]) ).
tcf(c_55,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f203]) ).
tcf(c_69,negated_conjecture,
! [X0: $i] :
( ( X0 = sK3 )
| ~ ssList(X0)
| ~ frontsegP(sK3,X0) ),
inference(cnf_transformation,[],[f210]) ).
tcf(c_123,negated_conjecture,
frontsegP(sK3,sK2),
inference(global_subsumption_just,[status(thm)],[c_51,c_49,c_51]) ).
tcf(c_1821,plain,
( ( sK2 = sK3 )
| ~ ssList(sK2) ),
inference(superposition,[status(thm)],[c_123,c_69]) ).
tcf(c_1825,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1821,c_49,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC038+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.19/5.47 % Computer : n009.cluster.edu
% 0.19/5.47 % Model : x86_64 x86_64
% 0.19/5.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.47 % Memory : 8046.5625MB
% 0.19/5.47 % OS : Linux 6.8.0-71-generic
% 0.19/5.47 % CPULimit : 300
% 0.19/5.47 % WCLimit : 300
% 0.19/5.47 % DateTime : Thu Sep 24 16:02:35 UTC 2026
% 0.19/5.47 % CPUTime :
% 0.19/5.47 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.24/5.53 Running first-order theorem proving
% 0.24/5.53 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.24/5.55
% 0.24/5.55 % ======== iProver multi-core TPTP/SMT =========
% 0.24/5.55
% 0.24/5.55 % Detected problem language: tptp
% 0.24/5.57 % Proving...
% 4.36/6.57 % SZS status Started for theBenchmark.p
% 4.36/6.57 % SZS status Theorem for theBenchmark.p
% 4.36/6.57
% 4.36/6.57 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.36/6.57
% 4.36/6.57 % ------ iProver source info
% 4.36/6.57
% 4.36/6.57 % git: date: 2026-07-19 20:42:38 +0200
% 4.36/6.57 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.36/6.57 % git: non_committed_changes: false
% 4.36/6.57
% 4.36/6.57 % ------ Parsing...
% 4.36/6.57 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.36/6.57
% 4.36/6.57 % ------ 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 %
% 4.36/6.57
% 4.36/6.57 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.36/6.57
% 4.36/6.57 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.36/6.57 % ------ Proving...
% 4.36/6.57 % ------ Problem Properties
% 4.36/6.57
% 4.36/6.57 %
% 4.36/6.57 % clauses 39
% 4.36/6.57 % conjectures 17
% 4.36/6.57 % EPR 13
% 4.36/6.57 % Horn 36
% 4.36/6.57 % unary 9
% 4.36/6.57 % binary 4
% 4.36/6.57 % lits 126
% 4.36/6.57 % lits eq 30
% 4.36/6.57 % fd_pure 0
% 4.36/6.57 % fd_pseudo 0
% 4.36/6.57 % fd_cond 5
% 4.36/6.57 % fd_pseudo_cond 6
% 4.36/6.57 % AC symbols 0
% 4.36/6.57
% 4.36/6.57 % ------ Schedule dynamic 5 is on
% 4.36/6.57
% 4.36/6.57 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.36/6.57
% 4.36/6.57
% 4.36/6.57 % ------
% 4.36/6.57 % Current options:
% 4.36/6.57 % ------
% 4.36/6.57
% 4.36/6.57
% 4.36/6.57 %
% 4.36/6.57
% 4.36/6.57 % ------ Proving...
% 4.36/6.57 %
% 4.36/6.57
% 4.36/6.57 % SZS status Theorem for theBenchmark.p
% 4.36/6.57
% 4.36/6.57 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.36/6.57
% 4.36/6.57
%------------------------------------------------------------------------------