%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL454+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n016.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:46 PM UTC 2026
% Result : Theorem 0.12s 0.42s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 19 unt; 0 def)
% Number of atoms : 110 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 111 ( 45 ~; 41 |; 18 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-1 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 71 ( 59 !; 12 ?)
% 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/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
( implies_1
<=> ! [X,Y] : is_a_theorem(implies(X,implies(Y,X))) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,axiom,
( or_3
<=> ! [X,Y,Z] : is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f22,axiom,
( r1
<=> ! [P] : is_a_theorem(implies(or(P,P),P)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f37,axiom,
implies_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f45,axiom,
or_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
r1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ r1,
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(f73,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(X,implies(Y,X)))
| implies_1 )
& ( ! [X,Y] : is_a_theorem(implies(X,implies(Y,X)))
| ~ implies_1 ) ),
inference(NNF_transformation,[status(thm)],[f4]) ).
fof(f74,plain,
( ( ~ is_a_theorem(implies(sK6_skl,implies(sK7_skl,sK6_skl)))
| implies_1 )
& ( ! [X,Y] : is_a_theorem(implies(X,implies(Y,X)))
| ~ implies_1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6_skl,sK7_skl]),skolemize(X,sK6_skl),skolemize(Y,sK7_skl)],[f73]) ).
fof(f75,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(cnf_transformation,[status(thm)],[f74]) ).
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(f105,plain,
( ( ? [X,Y,Z] : ~ is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))
| or_3 )
& ( ! [X,Y,Z] : is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))
| ~ or_3 ) ),
inference(NNF_transformation,[status(thm)],[f12]) ).
fof(f106,plain,
( ( ~ is_a_theorem(implies(implies(sK23_skl,sK25_skl),implies(implies(sK24_skl,sK25_skl),implies(or(sK23_skl,sK24_skl),sK25_skl))))
| or_3 )
& ( ! [X,Y,Z] : is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))
| ~ or_3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl,sK24_skl,sK25_skl]),skolemize(X,sK23_skl),skolemize(Y,sK24_skl),skolemize(Z,sK25_skl)],[f105]) ).
fof(f107,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1))))
| ~ or_3 ),
inference(cnf_transformation,[status(thm)],[f106]) ).
fof(f145,plain,
( ( ? [P] : ~ is_a_theorem(implies(or(P,P),P))
| r1 )
& ( ! [P] : is_a_theorem(implies(or(P,P),P))
| ~ r1 ) ),
inference(NNF_transformation,[status(thm)],[f22]) ).
fof(f146,plain,
( ( ~ is_a_theorem(implies(or(sK44_skl,sK44_skl),sK44_skl))
| r1 )
& ( ! [P] : is_a_theorem(implies(or(P,P),P))
| ~ r1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK44_skl]),skolemize(P,sK44_skl)],[f145]) ).
fof(f148,plain,
( ~ is_a_theorem(implies(or(sK44_skl,sK44_skl),sK44_skl))
| r1 ),
inference(cnf_transformation,[status(thm)],[f146]) ).
fof(f178,plain,
modus_ponens,
inference(cnf_transformation,[status(thm)],[f35]) ).
fof(f180,plain,
implies_1,
inference(cnf_transformation,[status(thm)],[f37]) ).
fof(f181,plain,
implies_2,
inference(cnf_transformation,[status(thm)],[f38]) ).
fof(f188,plain,
or_3,
inference(cnf_transformation,[status(thm)],[f45]) ).
fof(f196,plain,
~ r1,
inference(cnf_transformation,[status(thm)],[f54]) ).
fof(f197,plain,
~ is_a_theorem(implies(or(sK44_skl,sK44_skl),sK44_skl)),
inference(forward_subsumption_resolution,[status(thm)],[f148,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(f200,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(forward_subsumption_resolution,[status(thm)],[f75,f180]) ).
fof(f216,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
inference(forward_subsumption_resolution,[status(thm)],[f79,f181]) ).
fof(f217,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X0,implies(X0,X1))) ),
inference(resolution,[status(thm)],[f216,f198]) ).
fof(f231,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1)))),
inference(forward_subsumption_resolution,[status(thm)],[f107,f188]) ).
fof(f252,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(or(X0,X0),X1))),
inference(resolution,[status(thm)],[f217,f231]) ).
fof(f255,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[status(thm)],[f217,f200]) ).
fof(f268,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f252,f198]) ).
fof(f270,plain,
~ is_a_theorem(implies(sK44_skl,sK44_skl)),
inference(resolution,[status(thm)],[f268,f197]) ).
fof(f274,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f270,f255]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL454+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n016.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Mon Sep 21 00:38:09 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.37 % Drodi V4.1.1
% 0.12/0.42 % Refutation found
% 0.12/0.42 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.44 % Elapsed time: 0.073269 seconds
% 0.12/0.44 % CPU time: 0.354336 seconds
% 0.12/0.44 % Total memory used: 88.503 MB
% 0.12/0.44 % Net memory used: 88.148 MB
%------------------------------------------------------------------------------