%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC024-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 : n016.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:38 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.41s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 22
% Syntax : Number of formulae : 69 ( 22 unt; 7 def)
% Number of atoms : 158 ( 22 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 177 ( 88 ~; 82 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 35 ( 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f61,axiom,
! [U] :
( frontsegP(U,U)
| ~ ssList(U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f85,axiom,
! [U,V] :
( ssList(app(V,U))
| ~ ssList(V)
| ~ ssList(U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f100,axiom,
! [U,V] :
( V = U
| neq(V,U)
| ~ ssList(V)
| ~ ssList(U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f115,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| ~ neq(U,V)
| U != V ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f144,axiom,
! [U,V,W] :
( frontsegP(W,U)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssList(V)
| app(U,V) != W ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f188,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f189,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f190,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f191,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f192,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f193,negated_conjecture,
! [A] :
( ~ frontsegP(sk1,A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ ssList(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f194,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f195,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f198,negated_conjecture,
( nil != sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f206,plain,
ssList(nil),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f259,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f61]) ).
fof(f284,plain,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f85]) ).
fof(f301,plain,
! [X0,X1] :
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f100]) ).
fof(f319,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ~ neq(U,V)
| U != V ) ),
inference(miniscoping,[status(thm)],[f115]) ).
fof(f320,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ neq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(thm)],[f319]) ).
fof(f358,plain,
! [U,W] :
( frontsegP(W,U)
| ~ ssList(W)
| ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| app(U,V) != W ) ),
inference(miniscoping,[status(thm)],[f144]) ).
fof(f359,plain,
! [X0,X1,X2] :
( frontsegP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X0,X1) != X2 ),
inference(cnf_transformation,[status(thm)],[f358]) ).
fof(f431,plain,
ssList(sk3),
inference(cnf_transformation,[status(thm)],[f188]) ).
fof(f432,plain,
ssList(sk4),
inference(cnf_transformation,[status(thm)],[f189]) ).
fof(f433,plain,
sk2 = sk4,
inference(cnf_transformation,[status(thm)],[f190]) ).
fof(f434,plain,
sk1 = sk3,
inference(cnf_transformation,[status(thm)],[f191]) ).
fof(f435,plain,
neq(sk2,nil),
inference(cnf_transformation,[status(thm)],[f192]) ).
fof(f436,plain,
! [X0] :
( ~ frontsegP(sk1,X0)
| ~ frontsegP(sk2,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f193]) ).
fof(f437,plain,
ssList(sk5),
inference(cnf_transformation,[status(thm)],[f194]) ).
fof(f438,plain,
app(sk3,sk5) = sk4,
inference(cnf_transformation,[status(thm)],[f195]) ).
fof(f442,plain,
( nil != sk3
| nil = sk4 ),
inference(cnf_transformation,[status(thm)],[f198]) ).
fof(f450,definition,
( sQ2_spl
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f451,plain,
( ~ sQ2_spl
| nil = sk4 ),
inference(component_clause,[status(thm)],[f450]) ).
fof(f453,definition,
( sQ3_spl
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f456,plain,
( ~ sQ3_spl
| sQ2_spl ),
inference(split_clause,[status(thm)],[f442,f450,f453]) ).
fof(f464,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(destructive_equality_resolution,[status(thm)],[f320]) ).
fof(f465,plain,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(duplicate_literals_removal,[status(thm)],[f464]) ).
fof(f472,plain,
! [X0,X1] :
( frontsegP(app(X1,X0),X1)
| ~ ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(destructive_equality_resolution,[status(thm)],[f359]) ).
fof(f490,plain,
neq(sk4,nil),
inference(forward_demodulation,[status(thm)],[f433,f435]) ).
fof(f491,plain,
( ~ sQ2_spl
| neq(sk4,sk4) ),
inference(forward_demodulation,[status(thm)],[f451,f490]) ).
fof(f492,plain,
( ~ sQ2_spl
| ~ ssList(sk4) ),
inference(resolution,[status(thm)],[f465,f491]) ).
fof(f493,plain,
( ~ sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f492,f432]) ).
fof(f494,plain,
~ sQ2_spl,
inference(contradiction_clause,[status(thm)],[f493]) ).
fof(f495,plain,
! [X0] :
( ~ frontsegP(sk1,X0)
| ~ frontsegP(sk4,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f433,f436]) ).
fof(f496,plain,
! [X0] :
( ~ frontsegP(sk3,X0)
| ~ frontsegP(sk4,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f434,f495]) ).
fof(f500,plain,
( ~ ssList(sk3)
| ~ frontsegP(sk4,sk3)
| ~ neq(sk3,nil)
| ~ ssList(sk3) ),
inference(resolution,[status(thm)],[f496,f259]) ).
fof(f501,definition,
( sQ4_spl
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f503,plain,
( sQ4_spl
| ~ ssList(nil) ),
inference(component_clause,[status(thm)],[f501]) ).
fof(f524,definition,
( sQ11_spl
<=> ssList(sk3) ),
introduced(definition,[new_symbols(definition,[sQ11_spl])],[split_symbol_definition]) ).
fof(f526,plain,
( sQ11_spl
| ~ ssList(sk3) ),
inference(component_clause,[status(thm)],[f524]) ).
fof(f528,definition,
( sQ12_spl
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[sQ12_spl])],[split_symbol_definition]) ).
fof(f530,plain,
( sQ12_spl
| ~ neq(sk3,nil) ),
inference(component_clause,[status(thm)],[f528]) ).
fof(f531,definition,
( sQ13_spl
<=> frontsegP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[sQ13_spl])],[split_symbol_definition]) ).
fof(f534,plain,
( ~ sQ13_spl
| ~ sQ12_spl
| ~ sQ11_spl ),
inference(split_clause,[status(thm)],[f500,f524,f528,f531]) ).
fof(f535,plain,
( sQ11_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f526,f431]) ).
fof(f536,plain,
sQ11_spl,
inference(contradiction_clause,[status(thm)],[f535]) ).
fof(f537,plain,
( sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f503,f206]) ).
fof(f538,plain,
sQ4_spl,
inference(contradiction_clause,[status(thm)],[f537]) ).
fof(f551,definition,
( sQ15_spl
<=> ssList(sk5) ),
introduced(definition,[new_symbols(definition,[sQ15_spl])],[split_symbol_definition]) ).
fof(f553,plain,
( sQ15_spl
| ~ ssList(sk5) ),
inference(component_clause,[status(thm)],[f551]) ).
fof(f555,plain,
( sQ12_spl
| sk3 = nil
| ~ ssList(sk3)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[f301,f530]) ).
fof(f559,plain,
( sQ12_spl
| sQ3_spl
| ~ sQ11_spl
| ~ sQ4_spl ),
inference(split_clause,[status(thm)],[f555,f501,f524,f453,f528]) ).
fof(f590,plain,
! [X0,X1] :
( frontsegP(app(X1,X0),X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f472,f284]) ).
fof(f592,plain,
( frontsegP(sk4,sk3)
| ~ ssList(sk3)
| ~ ssList(sk5) ),
inference(paramodulation,[status(thm)],[f438,f590]) ).
fof(f595,plain,
( sQ13_spl
| ~ sQ11_spl
| ~ sQ15_spl ),
inference(split_clause,[status(thm)],[f592,f551,f524,f531]) ).
fof(f596,plain,
( sQ15_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f553,f437]) ).
fof(f597,plain,
sQ15_spl,
inference(contradiction_clause,[status(thm)],[f596]) ).
fof(f598,plain,
$false,
inference(sat_refutation,[status(thm)],[f456,f494,f534,f536,f538,f559,f595,f597]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC024-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n016.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 07:54:40 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.38 % Drodi V4.1.1
% 0.09/0.41 % Refutation found
% 0.09/0.41 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.44 % Elapsed time: 0.067827 seconds
% 0.09/0.44 % CPU time: 0.172060 seconds
% 0.09/0.44 % Total memory used: 109.153 MB
% 0.09/0.44 % Net memory used: 109.006 MB
%------------------------------------------------------------------------------