%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC102+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.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 : Thu Sep 24 02:39:58 PM UTC 2026
% Result : Theorem 0.15s 0.39s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 10 unt; 2 def)
% Number of atoms : 80 ( 16 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 76 ( 25 ~; 22 |; 18 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 15 ( 11 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,axiom,
! [U] :
( ssList(U)
=> frontsegP(U,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( frontsegP(V,U)
& neq(U,nil) )
| ~ neq(V,nil)
| X != W
| U != W
| V != X ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( frontsegP(V,U)
& neq(U,nil) )
| ~ neq(V,nil)
| X != W
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f285,plain,
! [U] :
( frontsegP(U,U)
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f42]) ).
fof(f286,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f285]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ~ frontsegP(V,U)
| ~ neq(U,nil) )
& neq(V,nil)
& X = W
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f97]) ).
fof(f416,plain,
( ( ~ frontsegP(sK48_skl,sK47_skl)
| ~ neq(sK47_skl,nil) )
& neq(sK48_skl,nil)
& sK50_skl = sK49_skl
& sK47_skl = sK49_skl
& sK48_skl = sK50_skl
& ssList(sK50_skl)
& ssList(sK49_skl)
& ssList(sK48_skl)
& ssList(sK47_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK47_skl,sK48_skl,sK49_skl,sK50_skl]),skolemize(U,sK47_skl),skolemize(V,sK48_skl),skolemize(W,sK49_skl),skolemize(X,sK50_skl)],[f415]) ).
fof(f420,plain,
ssList(sK50_skl),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f421,plain,
sK48_skl = sK50_skl,
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f422,plain,
sK47_skl = sK49_skl,
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f423,plain,
sK50_skl = sK49_skl,
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f424,plain,
neq(sK48_skl,nil),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f425,plain,
( ~ frontsegP(sK48_skl,sK47_skl)
| ~ neq(sK47_skl,nil) ),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f426,definition,
( sQ0_spl
<=> neq(sK47_skl,nil) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f428,plain,
( sQ0_spl
| ~ neq(sK47_skl,nil) ),
inference(component_clause,[status(thm)],[f426]) ).
fof(f429,definition,
( sQ1_spl
<=> frontsegP(sK48_skl,sK47_skl) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f431,plain,
( sQ1_spl
| ~ frontsegP(sK48_skl,sK47_skl) ),
inference(component_clause,[status(thm)],[f429]) ).
fof(f432,plain,
( ~ sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f425,f426,f429]) ).
fof(f465,plain,
sK47_skl = sK50_skl,
inference(backward_demodulation,[status(thm)],[f423,f422]) ).
fof(f467,plain,
neq(sK50_skl,nil),
inference(forward_demodulation,[status(thm)],[f421,f424]) ).
fof(f468,plain,
( sQ0_spl
| ~ neq(sK50_skl,nil) ),
inference(forward_demodulation,[status(thm)],[f465,f428]) ).
fof(f469,plain,
( sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f468,f467]) ).
fof(f470,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f469]) ).
fof(f471,plain,
( sQ1_spl
| ~ frontsegP(sK50_skl,sK47_skl) ),
inference(forward_demodulation,[status(thm)],[f421,f431]) ).
fof(f472,plain,
( sQ1_spl
| ~ frontsegP(sK50_skl,sK50_skl) ),
inference(forward_demodulation,[status(thm)],[f465,f471]) ).
fof(f474,plain,
( sQ1_spl
| ~ ssList(sK50_skl) ),
inference(resolution,[status(thm)],[f286,f472]) ).
fof(f475,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f474,f420]) ).
fof(f476,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f475]) ).
fof(f477,plain,
$false,
inference(sat_refutation,[status(thm)],[f432,f470,f476]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC102+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n010.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 07:56:11 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.15/0.38 % Drodi V4.1.1
% 0.15/0.39 % Refutation found
% 0.15/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.43 % Elapsed time: 0.058806 seconds
% 0.15/0.43 % CPU time: 0.139032 seconds
% 0.15/0.43 % Total memory used: 13.815 MB
% 0.15/0.43 % Net memory used: 13.787 MB
%------------------------------------------------------------------------------