%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV009-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.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:46:25 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.61s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 43 ( 12 unt; 5 def)
% Number of atoms : 100 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 104 ( 47 ~; 52 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 18 ( 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X,Y] :
( less(Y,X)
| less_or_equal(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
less_or_equal(m,p),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
less_or_equal(p,q),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,negated_conjecture,
less_or_equal(q,n),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
! [X,Y] :
( less_or_equal(a(X),a(Y))
| ~ less_or_equal(Y,n)
| ~ less(j,Y)
| ~ less(X,i)
| ~ less_or_equal(m,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,negated_conjecture,
! [X,Y] :
( less_or_equal(a(X),a(Y))
| ~ less_or_equal(Y,j)
| ~ less_or_equal(X,Y)
| ~ less_or_equal(m,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,negated_conjecture,
! [X,Y] :
( less_or_equal(a(X),a(Y))
| ~ less_or_equal(Y,n)
| ~ less_or_equal(X,Y)
| ~ less_or_equal(i,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
~ less_or_equal(a(p),a(q)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,plain,
! [X0,X1] :
( less(X1,X0)
| less_or_equal(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f12,plain,
less_or_equal(m,p),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f13,plain,
less_or_equal(p,q),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f14,plain,
less_or_equal(q,n),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f15,plain,
! [X0,X1] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(X1,n)
| ~ less(j,X1)
| ~ less(X0,i)
| ~ less_or_equal(m,X0) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f16,plain,
! [X0,X1] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(X1,j)
| ~ less_or_equal(X0,X1)
| ~ less_or_equal(m,X0) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f17,plain,
! [X0,X1] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(X1,n)
| ~ less_or_equal(X0,X1)
| ~ less_or_equal(i,X0) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f18,plain,
~ less_or_equal(a(p),a(q)),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f19,plain,
( ~ less_or_equal(q,n)
| ~ less(j,q)
| ~ less(p,i)
| ~ less_or_equal(m,p) ),
inference(resolution,[status(thm)],[f15,f18]) ).
fof(f20,definition,
( sQ0_spl
<=> less_or_equal(m,p) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f22,plain,
( sQ0_spl
| ~ less_or_equal(m,p) ),
inference(component_clause,[status(thm)],[f20]) ).
fof(f23,definition,
( sQ1_spl
<=> less(p,i) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f25,plain,
( sQ1_spl
| ~ less(p,i) ),
inference(component_clause,[status(thm)],[f23]) ).
fof(f26,definition,
( sQ2_spl
<=> less(j,q) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f28,plain,
( sQ2_spl
| ~ less(j,q) ),
inference(component_clause,[status(thm)],[f26]) ).
fof(f29,definition,
( sQ3_spl
<=> less_or_equal(q,n) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f31,plain,
( sQ3_spl
| ~ less_or_equal(q,n) ),
inference(component_clause,[status(thm)],[f29]) ).
fof(f32,plain,
( ~ sQ3_spl
| ~ sQ2_spl
| ~ sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f19,f20,f23,f26,f29]) ).
fof(f33,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f31,f14]) ).
fof(f34,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f33]) ).
fof(f35,plain,
( sQ2_spl
| less_or_equal(q,j) ),
inference(resolution,[status(thm)],[f28,f10]) ).
fof(f36,plain,
! [X0] :
( sQ2_spl
| less_or_equal(a(X0),a(q))
| ~ less_or_equal(X0,q)
| ~ less_or_equal(m,X0) ),
inference(resolution,[status(thm)],[f35,f16]) ).
fof(f37,plain,
( sQ2_spl
| ~ less_or_equal(p,q)
| ~ less_or_equal(m,p) ),
inference(resolution,[status(thm)],[f36,f18]) ).
fof(f38,definition,
( sQ4_spl
<=> less_or_equal(p,q) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f40,plain,
( sQ4_spl
| ~ less_or_equal(p,q) ),
inference(component_clause,[status(thm)],[f38]) ).
fof(f41,plain,
( sQ2_spl
| ~ sQ4_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f37,f20,f38,f26]) ).
fof(f42,plain,
( sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f22,f12]) ).
fof(f43,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f42]) ).
fof(f44,plain,
( sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f40,f13]) ).
fof(f45,plain,
sQ4_spl,
inference(contradiction_clause,[status(thm)],[f44]) ).
fof(f46,plain,
( sQ1_spl
| less_or_equal(i,p) ),
inference(resolution,[status(thm)],[f25,f10]) ).
fof(f47,plain,
! [X0] :
( sQ1_spl
| less_or_equal(a(p),a(X0))
| ~ less_or_equal(X0,n)
| ~ less_or_equal(p,X0) ),
inference(resolution,[status(thm)],[f46,f17]) ).
fof(f48,plain,
( sQ1_spl
| ~ less_or_equal(q,n)
| ~ less_or_equal(p,q) ),
inference(resolution,[status(thm)],[f47,f18]) ).
fof(f49,plain,
( sQ1_spl
| ~ sQ3_spl
| ~ sQ4_spl ),
inference(split_clause,[status(thm)],[f48,f38,f29,f23]) ).
fof(f50,plain,
$false,
inference(sat_refutation,[status(thm)],[f32,f34,f41,f43,f45,f49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.57 % Computer : n008.cluster.edu
% 0.10/0.57 % Model : x86_64 x86_64
% 0.10/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57 % Memory : 8046.5625MB
% 0.10/0.57 % OS : Linux 6.8.0-71-generic
% 0.10/0.57 % CPULimit : 300
% 0.10/0.57 % WCLimit : 300
% 0.10/0.57 % DateTime : Mon Sep 21 08:27:10 UTC 2026
% 0.10/0.58 % CPUTime :
% 0.10/0.58 % Drodi V4.1.1
% 0.10/0.61 % Refutation found
% 0.10/0.61 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.61 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.63 % Elapsed time: 0.046247 seconds
% 0.13/0.63 % CPU time: 0.116866 seconds
% 0.13/0.63 % Total memory used: 16.631 MB
% 0.13/0.63 % Net memory used: 16.090 MB
%------------------------------------------------------------------------------