%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : COM004-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Fri Jul 15 01:32:27 EDT 2022
% Result : Unsatisfiable 0.12s 0.34s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 31 ( 17 unt; 0 nHn; 28 RR)
% Number of literals : 59 ( 16 equ; 30 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 20 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(make_node,axiom,
( failure_node(parent_of(X,Y),or(C,D))
| ~ failure_node(X,or(C,P))
| ~ failure_node(Y,or(D,Q))
| ~ contradictory(P,Q)
| ~ siblings(X,Y) ) ).
cnf(x_contradicts_not_x,axiom,
contradictory(X,negate(X)) ).
cnf(n_left_and_n_right_are_siblings,axiom,
siblings(left_child_of(X),right_child_of(X)) ).
cnf(n_left_is_atom,hypothesis,
failure_node(n_left,or(empty,atom)) ).
cnf(n_right_is_not_atom,hypothesis,
failure_node(n_right,or(empty,negate(atom))) ).
cnf(n_left_equals_left_child_of_n,hypothesis,
n_left = left_child_of(n) ).
cnf(n_right_equals_right_child_of_n,hypothesis,
n_right = right_child_of(n) ).
cnf(goal_is_there_an_empty_node,negated_conjecture,
~ failure_node(Z,or(empty,empty)) ).
cnf(refute_0_0,plain,
( ~ contradictory(atom,X_10)
| ~ failure_node(X_12,or(X_8,X_10))
| ~ failure_node(n_left,or(empty,atom))
| ~ siblings(n_left,X_12)
| failure_node(parent_of(n_left,X_12),or(empty,X_8)) ),
inference(subst,[],[make_node:[bind(C,$fot(empty)),bind(D,$fot(X_8)),bind(P,$fot(atom)),bind(Q,$fot(X_10)),bind(X,$fot(n_left)),bind(Y,$fot(X_12))]]) ).
cnf(refute_0_1,plain,
( ~ contradictory(atom,X_10)
| ~ failure_node(X_12,or(X_8,X_10))
| ~ siblings(n_left,X_12)
| failure_node(parent_of(n_left,X_12),or(empty,X_8)) ),
inference(resolve,[$cnf( failure_node(n_left,or(empty,atom)) )],[n_left_is_atom,refute_0_0]) ).
cnf(refute_0_2,plain,
( ~ contradictory(atom,negate(atom))
| ~ failure_node(n_right,or(empty,negate(atom)))
| ~ siblings(n_left,n_right)
| failure_node(parent_of(n_left,n_right),or(empty,empty)) ),
inference(subst,[],[refute_0_1:[bind(X_10,$fot(negate(atom))),bind(X_12,$fot(n_right)),bind(X_8,$fot(empty))]]) ).
cnf(refute_0_3,plain,
( ~ contradictory(atom,negate(atom))
| ~ siblings(n_left,n_right)
| failure_node(parent_of(n_left,n_right),or(empty,empty)) ),
inference(resolve,[$cnf( failure_node(n_right,or(empty,negate(atom))) )],[n_right_is_not_atom,refute_0_2]) ).
cnf(refute_0_4,plain,
contradictory(atom,negate(atom)),
inference(subst,[],[x_contradicts_not_x:[bind(X,$fot(atom))]]) ).
cnf(refute_0_5,plain,
( ~ siblings(n_left,n_right)
| failure_node(parent_of(n_left,n_right),or(empty,empty)) ),
inference(resolve,[$cnf( contradictory(atom,negate(atom)) )],[refute_0_4,refute_0_3]) ).
cnf(refute_0_6,plain,
siblings(left_child_of(n),right_child_of(n)),
inference(subst,[],[n_left_and_n_right_are_siblings:[bind(X,$fot(n))]]) ).
cnf(refute_0_7,plain,
X0 = X0,
introduced(tautology,[refl,[$fot(X0)]]) ).
cnf(refute_0_8,plain,
( X0 != X0
| X0 != Y0
| Y0 = X0 ),
introduced(tautology,[equality,[$cnf( $equal(X0,X0) ),[0],$fot(Y0)]]) ).
cnf(refute_0_9,plain,
( X0 != Y0
| Y0 = X0 ),
inference(resolve,[$cnf( $equal(X0,X0) )],[refute_0_7,refute_0_8]) ).
cnf(refute_0_10,plain,
( n_left != left_child_of(n)
| left_child_of(n) = n_left ),
inference(subst,[],[refute_0_9:[bind(X0,$fot(n_left)),bind(Y0,$fot(left_child_of(n)))]]) ).
cnf(refute_0_11,plain,
left_child_of(n) = n_left,
inference(resolve,[$cnf( $equal(n_left,left_child_of(n)) )],[n_left_equals_left_child_of_n,refute_0_10]) ).
cnf(refute_0_12,plain,
( left_child_of(n) != n_left
| ~ siblings(left_child_of(n),right_child_of(n))
| siblings(n_left,right_child_of(n)) ),
introduced(tautology,[equality,[$cnf( siblings(left_child_of(n),right_child_of(n)) ),[0],$fot(n_left)]]) ).
cnf(refute_0_13,plain,
( ~ siblings(left_child_of(n),right_child_of(n))
| siblings(n_left,right_child_of(n)) ),
inference(resolve,[$cnf( $equal(left_child_of(n),n_left) )],[refute_0_11,refute_0_12]) ).
cnf(refute_0_14,plain,
siblings(n_left,right_child_of(n)),
inference(resolve,[$cnf( siblings(left_child_of(n),right_child_of(n)) )],[refute_0_6,refute_0_13]) ).
cnf(refute_0_15,plain,
( n_right != right_child_of(n)
| right_child_of(n) = n_right ),
inference(subst,[],[refute_0_9:[bind(X0,$fot(n_right)),bind(Y0,$fot(right_child_of(n)))]]) ).
cnf(refute_0_16,plain,
right_child_of(n) = n_right,
inference(resolve,[$cnf( $equal(n_right,right_child_of(n)) )],[n_right_equals_right_child_of_n,refute_0_15]) ).
cnf(refute_0_17,plain,
( right_child_of(n) != n_right
| ~ siblings(n_left,right_child_of(n))
| siblings(n_left,n_right) ),
introduced(tautology,[equality,[$cnf( siblings(n_left,right_child_of(n)) ),[1],$fot(n_right)]]) ).
cnf(refute_0_18,plain,
( ~ siblings(n_left,right_child_of(n))
| siblings(n_left,n_right) ),
inference(resolve,[$cnf( $equal(right_child_of(n),n_right) )],[refute_0_16,refute_0_17]) ).
cnf(refute_0_19,plain,
siblings(n_left,n_right),
inference(resolve,[$cnf( siblings(n_left,right_child_of(n)) )],[refute_0_14,refute_0_18]) ).
cnf(refute_0_20,plain,
failure_node(parent_of(n_left,n_right),or(empty,empty)),
inference(resolve,[$cnf( siblings(n_left,n_right) )],[refute_0_19,refute_0_5]) ).
cnf(refute_0_21,plain,
~ failure_node(parent_of(n_left,n_right),or(empty,empty)),
inference(subst,[],[goal_is_there_an_empty_node:[bind(Z,$fot(parent_of(n_left,n_right)))]]) ).
cnf(refute_0_22,plain,
$false,
inference(resolve,[$cnf( failure_node(parent_of(n_left,n_right),or(empty,empty)) )],[refute_0_20,refute_0_21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : COM004-1 : TPTP v8.1.0. Released v1.1.0.
% 0.04/0.12 % Command : metis --show proof --show saturation %s
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 16 19:36:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.34 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.34
% 0.12/0.34 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.12/0.35
%------------------------------------------------------------------------------