%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC131+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n013.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:40:05 PM UTC 2026
% Result : Theorem 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 67 ( 17 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 71 ( 26 ~; 18 |; 15 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% 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 : 20 ( 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( cyclefreeP(V)
| neq(X,nil)
| U != W
| V != X ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( cyclefreeP(V)
| neq(X,nil)
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f217,plain,
! [U] :
( ! [V] :
( ( neq(U,V)
<=> U != V )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f15]) ).
fof(f218,plain,
! [U] :
( ! [V] :
( ( ( U = V
| neq(U,V) )
& ( U != V
| ~ neq(U,V) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(NNF_transformation,[status(thm)],[f217]) ).
fof(f220,plain,
! [X0,X1] :
( X0 = X1
| neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f218]) ).
fof(f223,plain,
ssList(nil),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f330,plain,
cyclefreeP(nil),
inference(cnf_transformation,[status(thm)],[f60]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ~ cyclefreeP(V)
& ~ neq(X,nil)
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f97]) ).
fof(f416,plain,
( ~ cyclefreeP(sK48_skl)
& ~ neq(sK50_skl,nil)
& 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(f418,plain,
ssList(sK48_skl),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f421,plain,
sK48_skl = sK50_skl,
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f423,plain,
~ neq(sK50_skl,nil),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f424,plain,
~ cyclefreeP(sK48_skl),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f457,plain,
~ neq(sK48_skl,nil),
inference(forward_demodulation,[status(thm)],[f421,f423]) ).
fof(f461,plain,
( sK48_skl = nil
| ~ ssList(nil)
| ~ ssList(sK48_skl) ),
inference(resolution,[status(thm)],[f220,f457]) ).
fof(f464,plain,
( sK48_skl = nil
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[status(thm)],[f461,f418]) ).
fof(f467,plain,
~ cyclefreeP(nil),
inference(backward_demodulation,[status(thm)],[f470,f424]) ).
fof(f470,plain,
sK48_skl = nil,
inference(forward_subsumption_resolution,[status(thm)],[f464,f223]) ).
fof(f471,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f467,f330]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC131+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.33 % Computer : n013.cluster.edu
% 0.09/0.33 % Model : x86_64 x86_64
% 0.09/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.33 % Memory : 8046.5625MB
% 0.09/0.33 % OS : Linux 6.8.0-71-generic
% 0.09/0.33 % CPULimit : 300
% 0.09/0.33 % WCLimit : 300
% 0.09/0.33 % DateTime : Mon Sep 21 07:57:05 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.35 % Drodi V4.1.1
% 0.14/0.38 % Refutation found
% 0.14/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.43 % Elapsed time: 0.078761 seconds
% 0.14/0.43 % CPU time: 0.203256 seconds
% 0.14/0.43 % Total memory used: 110.109 MB
% 0.14/0.43 % Net memory used: 109.956 MB
%------------------------------------------------------------------------------