%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC292-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 : n001.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:40 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.37s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 18
% Syntax : Number of formulae : 52 ( 16 unt; 8 def)
% Number of atoms : 98 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 83 ( 37 ~; 38 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 6 ( 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f66,axiom,
! [U] :
( strictorderedP(cons(U,nil))
| ~ ssItem(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(f189,negated_conjecture,
ssList(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,
~ strictorderedP(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f193,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f194,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f195,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f199,plain,
strictorderedP(nil),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f204,plain,
ssList(nil),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f262,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(thm)],[f66]) ).
fof(f299,plain,
! [X0,X1] :
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f100]) ).
fof(f430,plain,
ssList(sk4),
inference(cnf_transformation,[status(thm)],[f189]) ).
fof(f432,plain,
sk1 = sk3,
inference(cnf_transformation,[status(thm)],[f191]) ).
fof(f433,plain,
~ strictorderedP(sk1),
inference(cnf_transformation,[status(thm)],[f192]) ).
fof(f434,plain,
( nil != sk4
| nil = sk3 ),
inference(cnf_transformation,[status(thm)],[f193]) ).
fof(f435,plain,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(cnf_transformation,[status(thm)],[f194]) ).
fof(f436,plain,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
inference(cnf_transformation,[status(thm)],[f195]) ).
fof(f445,definition,
( sQ2_spl
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f446,plain,
( ~ sQ2_spl
| nil = sk3 ),
inference(component_clause,[status(thm)],[f445]) ).
fof(f448,definition,
( sQ3_spl
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f451,plain,
( ~ sQ3_spl
| sQ2_spl ),
inference(split_clause,[status(thm)],[f434,f445,f448]) ).
fof(f452,definition,
( sQ4_spl
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f455,definition,
( sQ5_spl
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f457,plain,
( sQ5_spl
| ~ neq(sk4,nil) ),
inference(component_clause,[status(thm)],[f455]) ).
fof(f458,plain,
( ~ sQ5_spl
| sQ4_spl ),
inference(split_clause,[status(thm)],[f435,f452,f455]) ).
fof(f459,definition,
( sQ6_spl
<=> cons(sk5,nil) = sk3 ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f460,plain,
( ~ sQ6_spl
| cons(sk5,nil) = sk3 ),
inference(component_clause,[status(thm)],[f459]) ).
fof(f462,plain,
( ~ sQ5_spl
| sQ6_spl ),
inference(split_clause,[status(thm)],[f436,f459,f455]) ).
fof(f498,plain,
~ strictorderedP(sk3),
inference(forward_demodulation,[status(thm)],[f432,f433]) ).
fof(f500,plain,
( ~ sQ2_spl
| strictorderedP(sk3) ),
inference(backward_demodulation,[status(thm)],[f446,f199]) ).
fof(f501,plain,
( ~ sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f500,f498]) ).
fof(f502,plain,
~ sQ2_spl,
inference(contradiction_clause,[status(thm)],[f501]) ).
fof(f503,plain,
( sQ5_spl
| sk4 = nil
| ~ ssList(sk4)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[f299,f457]) ).
fof(f506,definition,
( sQ8_spl
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f508,plain,
( sQ8_spl
| ~ ssList(nil) ),
inference(component_clause,[status(thm)],[f506]) ).
fof(f509,definition,
( sQ9_spl
<=> ssList(sk4) ),
introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).
fof(f511,plain,
( sQ9_spl
| ~ ssList(sk4) ),
inference(component_clause,[status(thm)],[f509]) ).
fof(f512,plain,
( sQ5_spl
| sQ3_spl
| ~ sQ9_spl
| ~ sQ8_spl ),
inference(split_clause,[status(thm)],[f503,f506,f509,f448,f455]) ).
fof(f513,plain,
( sQ8_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f508,f204]) ).
fof(f514,plain,
sQ8_spl,
inference(contradiction_clause,[status(thm)],[f513]) ).
fof(f515,plain,
( ~ sQ6_spl
| strictorderedP(sk3)
| ~ ssItem(sk5) ),
inference(paramodulation,[status(thm)],[f460,f262]) ).
fof(f519,definition,
( sQ10_spl
<=> strictorderedP(sk3) ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f520,plain,
( ~ sQ10_spl
| strictorderedP(sk3) ),
inference(component_clause,[status(thm)],[f519]) ).
fof(f522,plain,
( ~ sQ6_spl
| sQ10_spl
| ~ sQ4_spl ),
inference(split_clause,[status(thm)],[f515,f452,f519,f459]) ).
fof(f529,plain,
( ~ sQ10_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f520,f498]) ).
fof(f530,plain,
~ sQ10_spl,
inference(contradiction_clause,[status(thm)],[f529]) ).
fof(f531,plain,
( sQ9_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f511,f430]) ).
fof(f532,plain,
sQ9_spl,
inference(contradiction_clause,[status(thm)],[f531]) ).
fof(f533,plain,
$false,
inference(sat_refutation,[status(thm)],[f451,f458,f462,f502,f512,f514,f522,f530,f532]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC292-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n001.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 08:18:30 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.37 % Drodi V4.1.1
% 0.10/0.37 % Refutation found
% 0.10/0.37 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.42 % Elapsed time: 0.065022 seconds
% 0.13/0.42 % CPU time: 0.091788 seconds
% 0.13/0.42 % Total memory used: 17.024 MB
% 0.13/0.42 % Net memory used: 16.994 MB
%------------------------------------------------------------------------------