%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL465+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 : n026.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:48 PM UTC 2026
% Result : Theorem 0.08s 5.40s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 8 unt; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 29 ( 13 ~; 10 |; 4 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 30 ( 24 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
( implies_3
<=> ! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f19,axiom,
( cn1
<=> ! [P,Q,R] : is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f36,axiom,
cn1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f43,conjecture,
implies_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f44,negated_conjecture,
~ implies_3,
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f71,plain,
( ( ? [X,Y,Z] : ~ is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))
| implies_3 )
& ( ! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))
| ~ implies_3 ) ),
inference(NNF_transformation,[status(thm)],[f6]) ).
fof(f72,plain,
( ( ~ is_a_theorem(implies(implies(sK10_skl,sK11_skl),implies(implies(sK11_skl,sK12_skl),implies(sK10_skl,sK12_skl))))
| implies_3 )
& ( ! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))
| ~ implies_3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10_skl,sK11_skl,sK12_skl]),skolemize(X,sK10_skl),skolemize(Y,sK11_skl),skolemize(Z,sK12_skl)],[f71]) ).
fof(f74,plain,
( ~ is_a_theorem(implies(implies(sK10_skl,sK11_skl),implies(implies(sK11_skl,sK12_skl),implies(sK10_skl,sK12_skl))))
| implies_3 ),
inference(cnf_transformation,[status(thm)],[f72]) ).
fof(f123,plain,
( ( ? [P,Q,R] : ~ is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))
| cn1 )
& ( ! [P,Q,R] : is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))
| ~ cn1 ) ),
inference(NNF_transformation,[status(thm)],[f19]) ).
fof(f124,plain,
( ( ~ is_a_theorem(implies(implies(sK38_skl,sK39_skl),implies(implies(sK39_skl,sK40_skl),implies(sK38_skl,sK40_skl))))
| cn1 )
& ( ! [P,Q,R] : is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))
| ~ cn1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK38_skl,sK39_skl,sK40_skl]),skolemize(P,sK38_skl),skolemize(Q,sK39_skl),skolemize(R,sK40_skl)],[f123]) ).
fof(f125,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ cn1 ),
inference(cnf_transformation,[status(thm)],[f124]) ).
fof(f169,plain,
cn1,
inference(cnf_transformation,[status(thm)],[f36]) ).
fof(f176,plain,
~ implies_3,
inference(cnf_transformation,[status(thm)],[f44]) ).
fof(f181,plain,
~ is_a_theorem(implies(implies(sK10_skl,sK11_skl),implies(implies(sK11_skl,sK12_skl),implies(sK10_skl,sK12_skl)))),
inference(forward_subsumption_resolution,[status(thm)],[f74,f176]) ).
fof(f183,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(forward_subsumption_resolution,[status(thm)],[f125,f169]) ).
fof(f184,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f181,f183]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL465+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/5.36 % Computer : n026.cluster.edu
% 0.08/5.36 % Model : x86_64 x86_64
% 0.08/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.36 % Memory : 8046.5625MB
% 0.08/5.36 % OS : Linux 6.8.0-71-generic
% 0.08/5.37 % CPULimit : 300
% 0.08/5.37 % WCLimit : 300
% 0.08/5.37 % DateTime : Mon Sep 21 00:36:42 UTC 2026
% 0.08/5.37 % CPUTime :
% 0.08/5.38 % Drodi V4.1.1
% 0.08/5.40 % Refutation found
% 0.08/5.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/5.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/5.43 % Elapsed time: 0.053908 seconds
% 0.13/5.43 % CPU time: 0.150741 seconds
% 0.13/5.43 % Total memory used: 70.037 MB
% 0.13/5.43 % Net memory used: 69.998 MB
%------------------------------------------------------------------------------