%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : COM004-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n009.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 12:10:15 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 24 ( 18 unt; 0 def)
% Number of atoms : 42 ( 4 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 39 ( 21 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 29 ( 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y,C,D,P,Q] :
( ~ siblings(X,Y)
| ~ contradictory(P,Q)
| ~ failure_node(Y,or(D,Q))
| ~ failure_node(X,or(C,P))
| failure_node(parent_of(X,Y),or(C,D)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X] : contradictory(X,negate(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X] : siblings(left_child_of(X),right_child_of(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,hypothesis,
failure_node(n_left,or(empty,atom)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,hypothesis,
failure_node(n_right,or(empty,negate(atom))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,hypothesis,
n_left = left_child_of(n),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,hypothesis,
n_right = right_child_of(n),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
! [Z] : ~ failure_node(Z,or(empty,empty)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,plain,
! [X,Y] :
( ~ siblings(X,Y)
| ! [P,Q] :
( ~ contradictory(P,Q)
| ! [D] :
( ~ failure_node(Y,or(D,Q))
| ! [C] :
( ~ failure_node(X,or(C,P))
| failure_node(parent_of(X,Y),or(C,D)) ) ) ) ),
inference(miniscoping,[status(thm)],[f1]) ).
fof(f11,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ siblings(X0,X1)
| ~ contradictory(X4,X5)
| ~ failure_node(X1,or(X3,X5))
| ~ failure_node(X0,or(X2,X4))
| failure_node(parent_of(X0,X1),or(X2,X3)) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
fof(f13,plain,
! [X0] : contradictory(X0,negate(X0)),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f14,plain,
! [X0] : siblings(left_child_of(X0),right_child_of(X0)),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f15,plain,
failure_node(n_left,or(empty,atom)),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f16,plain,
failure_node(n_right,or(empty,negate(atom))),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f17,plain,
n_left = left_child_of(n),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f18,plain,
n_right = right_child_of(n),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f19,plain,
! [X0] : ~ failure_node(X0,or(empty,empty)),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f20,plain,
siblings(n_left,right_child_of(n)),
inference(paramodulation,[status(thm)],[f17,f14]) ).
fof(f22,plain,
siblings(n_left,n_right),
inference(forward_demodulation,[status(thm)],[f18,f20]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ~ siblings(X0,n_right)
| ~ contradictory(X2,negate(atom))
| ~ failure_node(X0,or(X1,X2))
| failure_node(parent_of(X0,n_right),or(X1,empty)) ),
inference(resolution,[status(thm)],[f16,f11]) ).
fof(f26,plain,
! [X0,X1] :
( ~ contradictory(X1,negate(atom))
| ~ failure_node(n_left,or(X0,X1))
| failure_node(parent_of(n_left,n_right),or(X0,empty)) ),
inference(resolution,[status(thm)],[f25,f22]) ).
fof(f27,plain,
( ~ contradictory(atom,negate(atom))
| failure_node(parent_of(n_left,n_right),or(empty,empty)) ),
inference(resolution,[status(thm)],[f26,f15]) ).
fof(f28,plain,
~ contradictory(atom,negate(atom)),
inference(forward_subsumption_resolution,[status(thm)],[f27,f19]) ).
fof(f29,plain,
$false,
inference(resolution,[status(thm)],[f28,f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : COM004-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.41 % Computer : n009.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8046.5625MB
% 0.16/0.41 % OS : Linux 6.8.0-71-generic
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Mon Sep 21 14:13:42 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.43 % Drodi V4.1.1
% 0.16/0.45 % Refutation found
% 0.16/0.45 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.16/0.45 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.48 % Elapsed time: 0.052437 seconds
% 0.16/0.48 % CPU time: 0.137831 seconds
% 0.16/0.48 % Total memory used: 33.260 MB
% 0.16/0.48 % Net memory used: 33.048 MB
%------------------------------------------------------------------------------