%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC258-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 : n007.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:33 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 30 ( 10 unt; 4 def)
% Number of atoms : 52 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 17 ~; 18 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 2 ( 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f67,axiom,
! [U] :
( totalorderedP(cons(U,nil))
| ~ ssItem(U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f191,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f192,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f194,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f198,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f204,plain,
totalorderedP(nil),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f267,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(thm)],[f67]) ).
fof(f436,plain,
sk1 = sk3,
inference(cnf_transformation,[status(thm)],[f191]) ).
fof(f437,plain,
~ totalorderedP(sk1),
inference(cnf_transformation,[status(thm)],[f192]) ).
fof(f439,plain,
( nil = sk3
| ssItem(sk5) ),
inference(cnf_transformation,[status(thm)],[f194]) ).
fof(f444,plain,
( nil = sk3
| cons(sk5,nil) = sk3 ),
inference(cnf_transformation,[status(thm)],[f198]) ).
fof(f455,definition,
( sQ2_spl
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f462,definition,
( sQ4_spl
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f463,plain,
( ~ sQ4_spl
| nil = sk3 ),
inference(component_clause,[status(thm)],[f462]) ).
fof(f465,plain,
( sQ4_spl
| sQ2_spl ),
inference(split_clause,[status(thm)],[f439,f455,f462]) ).
fof(f466,definition,
( sQ5_spl
<=> cons(sk5,nil) = sk3 ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f467,plain,
( ~ sQ5_spl
| cons(sk5,nil) = sk3 ),
inference(component_clause,[status(thm)],[f466]) ).
fof(f478,plain,
( sQ4_spl
| sQ5_spl ),
inference(split_clause,[status(thm)],[f444,f466,f462]) ).
fof(f512,plain,
~ totalorderedP(sk3),
inference(forward_demodulation,[status(thm)],[f436,f437]) ).
fof(f514,plain,
( ~ sQ4_spl
| totalorderedP(sk3) ),
inference(backward_demodulation,[status(thm)],[f463,f204]) ).
fof(f515,plain,
( ~ sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f514,f512]) ).
fof(f516,plain,
~ sQ4_spl,
inference(contradiction_clause,[status(thm)],[f515]) ).
fof(f517,plain,
( ~ sQ5_spl
| totalorderedP(sk3)
| ~ ssItem(sk5) ),
inference(paramodulation,[status(thm)],[f467,f267]) ).
fof(f518,definition,
( sQ8_spl
<=> totalorderedP(sk3) ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f519,plain,
( ~ sQ8_spl
| totalorderedP(sk3) ),
inference(component_clause,[status(thm)],[f518]) ).
fof(f521,plain,
( ~ sQ5_spl
| sQ8_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f517,f455,f518,f466]) ).
fof(f522,plain,
( ~ sQ8_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f519,f512]) ).
fof(f523,plain,
~ sQ8_spl,
inference(contradiction_clause,[status(thm)],[f522]) ).
fof(f524,plain,
$false,
inference(sat_refutation,[status(thm)],[f465,f478,f516,f521,f523]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC258-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n007.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 08:07:06 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.14/0.38 % Drodi V4.1.1
% 0.14/0.39 % Refutation found
% 0.14/0.39 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.43 % Elapsed time: 0.067129 seconds
% 0.14/0.43 % CPU time: 0.089828 seconds
% 0.14/0.43 % Total memory used: 6.831 MB
% 0.14/0.43 % Net memory used: 6.823 MB
%------------------------------------------------------------------------------