%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL459+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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:07:47 PM UTC 2026
% Result : Theorem 0.11s 0.39s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 14 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 95 ( 38 ~; 35 |; 16 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 5 prp; 0-1 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 49 ( 40 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X,Y] :
( ( is_a_theorem(implies(X,Y))
& is_a_theorem(X) )
=> is_a_theorem(Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
( implies_2
<=> ! [X,Y] : is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,axiom,
( and_3
<=> ! [X,Y] : is_a_theorem(implies(X,implies(Y,and(X,Y)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,axiom,
( kn1
<=> ! [P] : is_a_theorem(implies(P,and(P,P))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
kn1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ kn1,
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f55,plain,
( modus_ponens
<=> ! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) ) ),
inference(pre_NNF_transformation,[status(thm)],[f1]) ).
fof(f56,plain,
( ( ? [X,Y] :
( ~ is_a_theorem(Y)
& is_a_theorem(implies(X,Y))
& is_a_theorem(X) )
| modus_ponens )
& ( ! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) )
| ~ modus_ponens ) ),
inference(NNF_transformation,[status(thm)],[f55]) ).
fof(f57,plain,
( ( ? [Y] :
( ~ is_a_theorem(Y)
& ? [X] :
( is_a_theorem(implies(X,Y))
& is_a_theorem(X) ) )
| modus_ponens )
& ( ! [Y] :
( is_a_theorem(Y)
| ! [X] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) ) )
| ~ modus_ponens ) ),
inference(miniscoping,[status(thm)],[f56]) ).
fof(f58,plain,
( ( ( ~ is_a_theorem(sK0_skl)
& is_a_theorem(implies(sK1_skl,sK0_skl))
& is_a_theorem(sK1_skl) )
| modus_ponens )
& ( ! [Y] :
( is_a_theorem(Y)
| ! [X] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) ) )
| ~ modus_ponens ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(Y,sK0_skl),skolemize(X,sK1_skl)],[f57]) ).
fof(f59,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[status(thm)],[f58]) ).
fof(f77,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))
| implies_2 )
& ( ! [X,Y] : is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))
| ~ implies_2 ) ),
inference(NNF_transformation,[status(thm)],[f5]) ).
fof(f78,plain,
( ( ~ is_a_theorem(implies(implies(sK8_skl,implies(sK8_skl,sK9_skl)),implies(sK8_skl,sK9_skl)))
| implies_2 )
& ( ! [X,Y] : is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))
| ~ implies_2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8_skl,sK9_skl]),skolemize(X,sK8_skl),skolemize(Y,sK9_skl)],[f77]) ).
fof(f79,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(cnf_transformation,[status(thm)],[f78]) ).
fof(f93,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(X,implies(Y,and(X,Y))))
| and_3 )
& ( ! [X,Y] : is_a_theorem(implies(X,implies(Y,and(X,Y))))
| ~ and_3 ) ),
inference(NNF_transformation,[status(thm)],[f9]) ).
fof(f94,plain,
( ( ~ is_a_theorem(implies(sK17_skl,implies(sK18_skl,and(sK17_skl,sK18_skl))))
| and_3 )
& ( ! [X,Y] : is_a_theorem(implies(X,implies(Y,and(X,Y))))
| ~ and_3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17_skl,sK18_skl]),skolemize(X,sK17_skl),skolemize(Y,sK18_skl)],[f93]) ).
fof(f95,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(cnf_transformation,[status(thm)],[f94]) ).
fof(f121,plain,
( ( ? [P] : ~ is_a_theorem(implies(P,and(P,P)))
| kn1 )
& ( ! [P] : is_a_theorem(implies(P,and(P,P)))
| ~ kn1 ) ),
inference(NNF_transformation,[status(thm)],[f16]) ).
fof(f122,plain,
( ( ~ is_a_theorem(implies(sK32_skl,and(sK32_skl,sK32_skl)))
| kn1 )
& ( ! [P] : is_a_theorem(implies(P,and(P,P)))
| ~ kn1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK32_skl]),skolemize(P,sK32_skl)],[f121]) ).
fof(f124,plain,
( ~ is_a_theorem(implies(sK32_skl,and(sK32_skl,sK32_skl)))
| kn1 ),
inference(cnf_transformation,[status(thm)],[f122]) ).
fof(f178,plain,
modus_ponens,
inference(cnf_transformation,[status(thm)],[f35]) ).
fof(f181,plain,
implies_2,
inference(cnf_transformation,[status(thm)],[f38]) ).
fof(f185,plain,
and_3,
inference(cnf_transformation,[status(thm)],[f42]) ).
fof(f196,plain,
~ kn1,
inference(cnf_transformation,[status(thm)],[f54]) ).
fof(f197,plain,
~ is_a_theorem(implies(sK32_skl,and(sK32_skl,sK32_skl))),
inference(forward_subsumption_resolution,[status(thm)],[f124,f196]) ).
fof(f198,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[f59,f178]) ).
fof(f224,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
inference(forward_subsumption_resolution,[status(thm)],[f79,f181]) ).
fof(f225,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X0,implies(X0,X1))) ),
inference(resolution,[status(thm)],[f224,f198]) ).
fof(f290,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(forward_subsumption_resolution,[status(thm)],[f95,f185]) ).
fof(f347,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,X0))),
inference(resolution,[status(thm)],[f225,f290]) ).
fof(f358,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f197,f347]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL459+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n003.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 00:34:30 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.37 % Drodi V4.1.1
% 0.11/0.39 % Refutation found
% 0.11/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.42 % Elapsed time: 0.050563 seconds
% 0.14/0.42 % CPU time: 0.147199 seconds
% 0.14/0.42 % Total memory used: 83.666 MB
% 0.14/0.42 % Net memory used: 83.610 MB
%------------------------------------------------------------------------------