%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC134-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:06 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 31 ( 17 unt; 3 def)
% Number of atoms : 51 ( 7 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 39 ( 19 ~; 17 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 4 ( 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
ssList(nil),
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(f190,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f192,negated_conjecture,
~ neq(sk4,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f193,negated_conjecture,
~ cyclefreeP(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f200,plain,
cyclefreeP(nil),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f201,plain,
ssList(nil),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f296,plain,
! [X0,X1] :
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f100]) ).
fof(f427,plain,
ssList(sk4),
inference(cnf_transformation,[status(thm)],[f189]) ).
fof(f428,plain,
sk2 = sk4,
inference(cnf_transformation,[status(thm)],[f190]) ).
fof(f430,plain,
~ neq(sk4,nil),
inference(cnf_transformation,[status(thm)],[f192]) ).
fof(f431,plain,
~ cyclefreeP(sk2),
inference(cnf_transformation,[status(thm)],[f193]) ).
fof(f470,plain,
~ cyclefreeP(sk4),
inference(forward_demodulation,[status(thm)],[f428,f431]) ).
fof(f471,plain,
( sk4 = nil
| ~ ssList(sk4)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[f296,f430]) ).
fof(f474,definition,
( sQ2_spl
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f476,plain,
( sQ2_spl
| ~ ssList(nil) ),
inference(component_clause,[status(thm)],[f474]) ).
fof(f477,definition,
( sQ3_spl
<=> ssList(sk4) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f479,plain,
( sQ3_spl
| ~ ssList(sk4) ),
inference(component_clause,[status(thm)],[f477]) ).
fof(f480,definition,
( sQ4_spl
<=> sk4 = nil ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f481,plain,
( ~ sQ4_spl
| sk4 = nil ),
inference(component_clause,[status(thm)],[f480]) ).
fof(f483,plain,
( sQ4_spl
| ~ sQ3_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f471,f474,f477,f480]) ).
fof(f488,plain,
( ~ sQ4_spl
| cyclefreeP(sk4) ),
inference(backward_demodulation,[status(thm)],[f481,f200]) ).
fof(f489,plain,
( ~ sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f488,f470]) ).
fof(f490,plain,
~ sQ4_spl,
inference(contradiction_clause,[status(thm)],[f489]) ).
fof(f493,plain,
( sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f201,f476]) ).
fof(f494,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f493]) ).
fof(f495,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f479,f427]) ).
fof(f496,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f495]) ).
fof(f497,plain,
$false,
inference(sat_refutation,[status(thm)],[f483,f490,f494,f496]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC134-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.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 07:57:51 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.42 % Drodi V4.1.1
% 0.10/0.43 % Refutation found
% 0.10/0.43 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.43 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.48 % Elapsed time: 0.091075 seconds
% 0.15/0.48 % CPU time: 0.121932 seconds
% 0.15/0.48 % Total memory used: 6.836 MB
% 0.15/0.48 % Net memory used: 6.822 MB
%------------------------------------------------------------------------------