%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL083-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 : n019.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.14s 5.68s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 6 unt; 3 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 94 ( 48 ~; 43 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 67 ( 67 !; 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,
! [X,Y,Z,U] : is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(Z,X),implies(U,X)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),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] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f7,plain,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f8,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(implies(implies(X2,X0),implies(X3,X0)))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(resolution,[status(thm)],[f6,f5]) ).
fof(f9,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(implies(X3,X0))
| ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(resolution,[status(thm)],[f8,f5]) ).
fof(f11,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(X0)
| ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(resolution,[status(thm)],[f9,f5]) ).
fof(f12,definition,
! [X0,X1,X2] :
( sQ0_spl
<=> ( is_a_theorem(X0)
| ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ~ sQ0_spl
| is_a_theorem(X0)
| ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(component_clause,[status(thm)],[f12]) ).
fof(f15,definition,
! [X3] :
( sQ1_spl
<=> ~ is_a_theorem(X3) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f16,plain,
! [X0] :
( ~ sQ1_spl
| ~ is_a_theorem(X0) ),
inference(component_clause,[status(thm)],[f15]) ).
fof(f18,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f11,f12,f15]) ).
fof(f29,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ0_spl
| is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))
| ~ is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),X3),implies(implies(X1,X4),X0))) ),
inference(resolution,[status(thm)],[f13,f6]) ).
fof(f32,plain,
! [X0,X1,X2,X3] :
( ~ sQ0_spl
| ~ is_a_theorem(implies(implies(X0,X3),implies(implies(X0,X1),implies(X2,X1))))
| is_a_theorem(implies(implies(X0,X1),implies(X2,X1))) ),
inference(resolution,[status(thm)],[f29,f8]) ).
fof(f44,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ0_spl
| ~ is_a_theorem(implies(implies(X1,X4),X3))
| is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X3,X1))) ),
inference(resolution,[status(thm)],[f13,f8]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ~ sQ0_spl
| is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X2,X0))) ),
inference(resolution,[status(thm)],[f32,f6]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ~ sQ0_spl
| is_a_theorem(implies(implies(implies(implies(X0,X1),X2),X1),implies(X0,X1))) ),
inference(resolution,[status(thm)],[f47,f32]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ~ sQ0_spl
| is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(implies(X0,X1),X0)) ),
inference(resolution,[status(thm)],[f47,f5]) ).
fof(f55,plain,
! [X0,X1] :
( ~ sQ0_spl
| is_a_theorem(implies(X0,implies(X1,X1))) ),
inference(resolution,[status(thm)],[f54,f47]) ).
fof(f63,plain,
! [X0,X1] :
( ~ sQ0_spl
| is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f55,f5]) ).
fof(f64,definition,
! [X1] :
( sQ4_spl
<=> is_a_theorem(implies(X1,X1)) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f65,plain,
! [X0] :
( ~ sQ4_spl
| is_a_theorem(implies(X0,X0)) ),
inference(component_clause,[status(thm)],[f64]) ).
fof(f67,plain,
( ~ sQ0_spl
| sQ4_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f63,f15,f64,f12]) ).
fof(f68,plain,
( ~ sQ1_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f6,f16]) ).
fof(f69,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f68]) ).
fof(f197,plain,
! [X0,X1,X2] :
( ~ sQ0_spl
| ~ is_a_theorem(implies(implies(X1,X2),X0))
| is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(resolution,[status(thm)],[f44,f50]) ).
fof(f246,plain,
! [X0] :
( ~ sQ0_spl
| ~ is_a_theorem(implies(implies(a,X0),implies(a,b))) ),
inference(resolution,[status(thm)],[f197,f7]) ).
fof(f264,plain,
( ~ sQ4_spl
| ~ sQ0_spl
| $false ),
inference(resolution,[status(thm)],[f246,f65]) ).
fof(f265,plain,
( ~ sQ4_spl
| ~ sQ0_spl ),
inference(contradiction_clause,[status(thm)],[f264]) ).
fof(f266,plain,
$false,
inference(sat_refutation,[status(thm)],[f18,f67,f69,f265]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL083-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/5.58 % Computer : n019.cluster.edu
% 0.10/5.58 % Model : x86_64 x86_64
% 0.10/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.58 % Memory : 8046.5625MB
% 0.10/5.58 % OS : Linux 6.8.0-71-generic
% 0.10/5.59 % CPULimit : 300
% 0.10/5.59 % WCLimit : 300
% 0.10/5.59 % DateTime : Mon Sep 21 00:04:26 UTC 2026
% 0.10/5.59 % CPUTime :
% 0.14/5.60 % Drodi V4.1.1
% 0.14/5.68 % Refutation found
% 0.14/5.68 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/5.68 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/5.69 % Elapsed time: 0.099821 seconds
% 0.14/5.69 % CPU time: 0.578551 seconds
% 0.14/5.69 % Total memory used: 65.545 MB
% 0.14/5.69 % Net memory used: 63.096 MB
%------------------------------------------------------------------------------