%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL087-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 : 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 01:06:46 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.40s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 8 unt; 5 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 79 ( 38 ~; 36 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 80 ( 80 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [P,Q,R,S,T] : is_a_theorem(implies(implies(implies(P,Q),implies(R,S)),implies(T,implies(implies(S,P),implies(R,P))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,plain,
! [Y] :
( is_a_theorem(Y)
| ! [X] :
( ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ) ),
inference(miniscoping,[status(thm)],[f1]) ).
fof(f5,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f6,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X3)),implies(X4,implies(implies(X3,X0),implies(X2,X0))))),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f7,plain,
~ is_a_theorem(implies(a,implies(b,a))),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f8,plain,
! [X0,X1,X2,X3,X4] :
( is_a_theorem(implies(X4,implies(implies(X3,X0),implies(X2,X0))))
| ~ is_a_theorem(implies(implies(X0,X1),implies(X2,X3))) ),
inference(resolution,[status(thm)],[f6,f5]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(implies(X0,implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4))))),
inference(resolution,[status(thm)],[f8,f6]) ).
fof(f11,plain,
! [X0,X1,X2,X3,X4,X5] :
( is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f9,f5]) ).
fof(f12,definition,
! [X0] :
( sQ0_spl
<=> ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f13,plain,
! [X0] :
( ~ sQ0_spl
| ~ is_a_theorem(X0) ),
inference(component_clause,[status(thm)],[f12]) ).
fof(f15,definition,
! [X1,X2,X3,X4,X5] :
( sQ1_spl
<=> is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4)))) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f16,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ1_spl
| is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))) ),
inference(component_clause,[status(thm)],[f15]) ).
fof(f18,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f11,f12,f15]) ).
fof(f19,plain,
( ~ sQ0_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f6,f13]) ).
fof(f21,plain,
~ sQ0_spl,
inference(contradiction_clause,[status(thm)],[f19]) ).
fof(f22,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ1_spl
| is_a_theorem(implies(X4,implies(X1,X3)))
| ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3))) ),
inference(resolution,[status(thm)],[f16,f5]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X2,implies(X1,X2))))) ),
inference(resolution,[status(thm)],[f22,f16]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f29,f5]) ).
fof(f35,definition,
! [X1,X2] :
( sQ2_spl
<=> is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2)))) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f36,plain,
! [X0,X1] :
( ~ sQ2_spl
| is_a_theorem(implies(implies(X0,X1),implies(X1,implies(X0,X1)))) ),
inference(component_clause,[status(thm)],[f35]) ).
fof(f38,plain,
( ~ sQ1_spl
| sQ2_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f34,f12,f35,f15]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ~ sQ2_spl
| is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X2,X1)))) ),
inference(resolution,[status(thm)],[f36,f8]) ).
fof(f76,plain,
! [X0,X1,X2] :
( ~ sQ2_spl
| is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f39,f5]) ).
fof(f78,definition,
! [X1,X2] :
( sQ5_spl
<=> is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1))) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f79,plain,
! [X0,X1] :
( ~ sQ5_spl
| is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X1,X0))) ),
inference(component_clause,[status(thm)],[f78]) ).
fof(f81,plain,
( ~ sQ2_spl
| sQ5_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f76,f12,f78,f35]) ).
fof(f82,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| ~ sQ5_spl
| is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))) ),
inference(resolution,[status(thm)],[f79,f22]) ).
fof(f90,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| ~ sQ5_spl
| is_a_theorem(implies(X1,implies(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f82,f5]) ).
fof(f92,definition,
! [X1,X2] :
( sQ6_spl
<=> is_a_theorem(implies(X1,implies(X2,X1))) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f93,plain,
! [X0,X1] :
( ~ sQ6_spl
| is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(component_clause,[status(thm)],[f92]) ).
fof(f95,plain,
( ~ sQ1_spl
| ~ sQ5_spl
| sQ6_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f90,f12,f92,f78,f15]) ).
fof(f96,plain,
( ~ sQ6_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f7,f93]) ).
fof(f101,plain,
~ sQ6_spl,
inference(contradiction_clause,[status(thm)],[f96]) ).
fof(f102,plain,
$false,
inference(sat_refutation,[status(thm)],[f18,f21,f38,f81,f95,f101]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL087-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n007.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 00:02:20 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.12/0.36 % Drodi V4.1.1
% 0.12/0.40 % Refutation found
% 0.12/0.40 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.42 % Elapsed time: 0.058318 seconds
% 0.12/0.42 % CPU time: 0.143061 seconds
% 0.12/0.42 % Total memory used: 55.677 MB
% 0.12/0.42 % Net memory used: 55.111 MB
%------------------------------------------------------------------------------