%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL493+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 : n017.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:51 PM UTC 2026
% Result : Theorem 8.65s 1.79s
% Output : CNFRefutation 8.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 20
% Syntax : Number of formulae : 88 ( 44 unt; 0 def)
% Number of atoms : 173 ( 24 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 143 ( 58 ~; 55 |; 18 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 11 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 11 con; 0-2 aty)
% Number of variables : 150 ( 137 !; 13 ?)
% 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(f13,axiom,
( equivalence_1
<=> ! [X,Y] : is_a_theorem(implies(equiv(X,Y),implies(X,Y))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f23,axiom,
( r2
<=> ! [P,Q] : is_a_theorem(implies(Q,or(P,Q))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f24,axiom,
( r3
<=> ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f26,axiom,
( r5
<=> ! [P,Q,R] : is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f27,axiom,
( op_or
=> ! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f28,axiom,
( op_and
=> ! [X,Y] : and(X,Y) = not(or(not(X),not(Y))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f29,axiom,
( op_implies_and
=> ! [X,Y] : implies(X,Y) = not(and(X,not(Y))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f30,axiom,
( op_implies_or
=> ! [X,Y] : implies(X,Y) = or(not(X),Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f31,axiom,
( op_equiv
=> ! [X,Y] : equiv(X,Y) = and(implies(X,Y),implies(Y,X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f33,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f34,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f40,axiom,
r5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f42,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f43,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f45,conjecture,
equivalence_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f46,negated_conjecture,
~ equivalence_1,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,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(f48,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)],[f47]) ).
fof(f49,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)],[f48]) ).
fof(f50,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)],[f49]) ).
fof(f51,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[status(thm)],[f50]) ).
fof(f101,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(equiv(X,Y),implies(X,Y)))
| equivalence_1 )
& ( ! [X,Y] : is_a_theorem(implies(equiv(X,Y),implies(X,Y)))
| ~ equivalence_1 ) ),
inference(NNF_transformation,[status(thm)],[f13]) ).
fof(f102,plain,
( ( ~ is_a_theorem(implies(equiv(sK26_skl,sK27_skl),implies(sK26_skl,sK27_skl)))
| equivalence_1 )
& ( ! [X,Y] : is_a_theorem(implies(equiv(X,Y),implies(X,Y)))
| ~ equivalence_1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK26_skl,sK27_skl]),skolemize(X,sK26_skl),skolemize(Y,sK27_skl)],[f101]) ).
fof(f104,plain,
( ~ is_a_theorem(implies(equiv(sK26_skl,sK27_skl),implies(sK26_skl,sK27_skl)))
| equivalence_1 ),
inference(cnf_transformation,[status(thm)],[f102]) ).
fof(f141,plain,
( ( ? [P,Q] : ~ is_a_theorem(implies(Q,or(P,Q)))
| r2 )
& ( ! [P,Q] : is_a_theorem(implies(Q,or(P,Q)))
| ~ r2 ) ),
inference(NNF_transformation,[status(thm)],[f23]) ).
fof(f142,plain,
( ( ~ is_a_theorem(implies(sK46_skl,or(sK45_skl,sK46_skl)))
| r2 )
& ( ! [P,Q] : is_a_theorem(implies(Q,or(P,Q)))
| ~ r2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK45_skl,sK46_skl]),skolemize(P,sK45_skl),skolemize(Q,sK46_skl)],[f141]) ).
fof(f143,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,or(X1,X0)))
| ~ r2 ),
inference(cnf_transformation,[status(thm)],[f142]) ).
fof(f145,plain,
( ( ? [P,Q] : ~ is_a_theorem(implies(or(P,Q),or(Q,P)))
| r3 )
& ( ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P)))
| ~ r3 ) ),
inference(NNF_transformation,[status(thm)],[f24]) ).
fof(f146,plain,
( ( ~ is_a_theorem(implies(or(sK47_skl,sK48_skl),or(sK48_skl,sK47_skl)))
| r3 )
& ( ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P)))
| ~ r3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK47_skl,sK48_skl]),skolemize(P,sK47_skl),skolemize(Q,sK48_skl)],[f145]) ).
fof(f147,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(cnf_transformation,[status(thm)],[f146]) ).
fof(f153,plain,
( ( ? [P,Q,R] : ~ is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))
| r5 )
& ( ! [P,Q,R] : is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))
| ~ r5 ) ),
inference(NNF_transformation,[status(thm)],[f26]) ).
fof(f154,plain,
( ( ~ is_a_theorem(implies(implies(sK53_skl,sK54_skl),implies(or(sK52_skl,sK53_skl),or(sK52_skl,sK54_skl))))
| r5 )
& ( ! [P,Q,R] : is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))
| ~ r5 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK52_skl,sK53_skl,sK54_skl]),skolemize(P,sK52_skl),skolemize(Q,sK53_skl),skolemize(R,sK54_skl)],[f153]) ).
fof(f155,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))))
| ~ r5 ),
inference(cnf_transformation,[status(thm)],[f154]) ).
fof(f157,plain,
( ! [X,Y] : or(X,Y) = not(and(not(X),not(Y)))
| ~ op_or ),
inference(pre_NNF_transformation,[status(thm)],[f27]) ).
fof(f158,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[status(thm)],[f157]) ).
fof(f159,plain,
( ! [X,Y] : and(X,Y) = not(or(not(X),not(Y)))
| ~ op_and ),
inference(pre_NNF_transformation,[status(thm)],[f28]) ).
fof(f160,plain,
! [X0,X1] :
( and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(cnf_transformation,[status(thm)],[f159]) ).
fof(f161,plain,
( ! [X,Y] : implies(X,Y) = not(and(X,not(Y)))
| ~ op_implies_and ),
inference(pre_NNF_transformation,[status(thm)],[f29]) ).
fof(f162,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[status(thm)],[f161]) ).
fof(f163,plain,
( ! [X,Y] : implies(X,Y) = or(not(X),Y)
| ~ op_implies_or ),
inference(pre_NNF_transformation,[status(thm)],[f30]) ).
fof(f164,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[status(thm)],[f163]) ).
fof(f165,plain,
( ! [X,Y] : equiv(X,Y) = and(implies(X,Y),implies(Y,X))
| ~ op_equiv ),
inference(pre_NNF_transformation,[status(thm)],[f31]) ).
fof(f166,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[status(thm)],[f165]) ).
fof(f167,plain,
op_implies_or,
inference(cnf_transformation,[status(thm)],[f32]) ).
fof(f168,plain,
op_and,
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f169,plain,
op_equiv,
inference(cnf_transformation,[status(thm)],[f34]) ).
fof(f170,plain,
modus_ponens,
inference(cnf_transformation,[status(thm)],[f35]) ).
fof(f172,plain,
r2,
inference(cnf_transformation,[status(thm)],[f37]) ).
fof(f173,plain,
r3,
inference(cnf_transformation,[status(thm)],[f38]) ).
fof(f175,plain,
r5,
inference(cnf_transformation,[status(thm)],[f40]) ).
fof(f177,plain,
op_or,
inference(cnf_transformation,[status(thm)],[f42]) ).
fof(f178,plain,
op_implies_and,
inference(cnf_transformation,[status(thm)],[f43]) ).
fof(f180,plain,
~ equivalence_1,
inference(cnf_transformation,[status(thm)],[f46]) ).
fof(f181,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f51,f170]) ).
fof(f185,plain,
! [X0,X1] : is_a_theorem(implies(X0,or(X1,X0))),
inference(forward_subsumption_resolution,[status(thm)],[f143,f172]) ).
fof(f189,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(forward_subsumption_resolution,[status(thm)],[f164,f167]) ).
fof(f190,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(paramodulation,[status(thm)],[f189,f185]) ).
fof(f228,plain,
! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))),
inference(forward_subsumption_resolution,[status(thm)],[f147,f173]) ).
fof(f229,plain,
! [X0,X1] :
( is_a_theorem(or(X1,X0))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f228,f181]) ).
fof(f237,plain,
! [X0,X1] :
( is_a_theorem(or(X1,not(X0)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(paramodulation,[status(thm)],[f189,f229]) ).
fof(f252,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[status(thm)],[f162,f178]) ).
fof(f274,plain,
! [X0,X1] : is_a_theorem(or(or(X0,X1),not(or(X1,X0)))),
inference(resolution,[status(thm)],[f237,f228]) ).
fof(f451,plain,
~ is_a_theorem(implies(equiv(sK26_skl,sK27_skl),implies(sK26_skl,sK27_skl))),
inference(forward_subsumption_resolution,[status(thm)],[f104,f180]) ).
fof(f619,plain,
! [X0,X1] :
( or(X0,X1) = implies(not(X0),X1)
| ~ op_or ),
inference(forward_demodulation,[status(thm)],[f252,f158]) ).
fof(f628,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_subsumption_resolution,[status(thm)],[f619,f177]) ).
fof(f662,plain,
! [X0,X1] : is_a_theorem(or(X0,implies(X1,not(X0)))),
inference(paramodulation,[status(thm)],[f628,f190]) ).
fof(f710,plain,
! [X0,X1] : is_a_theorem(or(implies(X0,not(X1)),X1)),
inference(resolution,[status(thm)],[f662,f229]) ).
fof(f935,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(forward_subsumption_resolution,[status(thm)],[f155,f175]) ).
fof(f937,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(or(X2,X0),or(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f935,f181]) ).
fof(f1033,plain,
! [X0,X1] :
( and(X0,X1) = not(implies(X0,not(X1)))
| ~ op_and ),
inference(forward_demodulation,[status(thm)],[f189,f160]) ).
fof(f1037,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_subsumption_resolution,[status(thm)],[f1033,f168]) ).
fof(f1038,plain,
! [X0,X1] : and(not(X0),X1) = not(or(X0,not(X1))),
inference(paramodulation,[status(thm)],[f628,f1037]) ).
fof(f1056,plain,
! [X0,X1,X2] : or(implies(X0,not(X1)),X2) = implies(and(X0,X1),X2),
inference(paramodulation,[status(thm)],[f1037,f628]) ).
fof(f1314,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(forward_subsumption_resolution,[status(thm)],[f166,f169]) ).
fof(f1950,plain,
! [X0,X1] : is_a_theorem(or(or(not(X0),X1),and(not(X1),X0))),
inference(paramodulation,[status(thm)],[f1038,f274]) ).
fof(f2003,plain,
! [X0,X1] : is_a_theorem(or(implies(X0,X1),and(not(X1),X0))),
inference(forward_demodulation,[status(thm)],[f189,f1950]) ).
fof(f2941,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)),
inference(backward_demodulation,[status(thm)],[f1056,f710]) ).
fof(f3170,plain,
! [X0,X1,X2] : is_a_theorem(implies(or(X0,and(X1,X2)),or(X0,X2))),
inference(resolution,[status(thm)],[f2941,f937]) ).
fof(f16081,plain,
! [X0,X1,X2] :
( is_a_theorem(or(X0,X2))
| ~ is_a_theorem(or(X0,and(X1,X2))) ),
inference(resolution,[status(thm)],[f3170,f181]) ).
fof(f36459,plain,
! [X0,X1] : is_a_theorem(or(implies(X0,X1),X0)),
inference(resolution,[status(thm)],[f16081,f2003]) ).
fof(f36526,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(paramodulation,[status(thm)],[f1056,f36459]) ).
fof(f36705,plain,
! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))),
inference(paramodulation,[status(thm)],[f1314,f36526]) ).
fof(f40384,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f451,f36705]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL493+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.38 % Computer : n017.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 00:31:12 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.40 % Drodi V4.1.1
% 8.65/1.79 % Refutation found
% 8.65/1.79 % SZS status Theorem for theBenchmark: Theorem is valid
% 8.65/1.79 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 4.37/1.87 % Elapsed time: 1.471703 seconds
% 4.37/1.87 % CPU time: 11.197987 seconds
% 4.37/1.87 % Total memory used: 281.280 MB
% 4.37/1.87 % Net memory used: 269.784 MB
%------------------------------------------------------------------------------