TSTP Solution File: COM004-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : COM004-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n013.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 : 300s
% DateTime : Wed Aug 30 18:36:14 EDT 2023
% Result : Unsatisfiable 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 21
% Syntax : Number of formulae : 34 ( 16 unt; 13 typ; 0 def)
% Number of atoms : 35 ( 4 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 31 ( 17 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 8 >; 5 *; 0 +; 0 <<)
% 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 : 24 ( 2 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
parent_of: ( $i * $i ) > $i ).
tff(decl_23,type,
or: ( $i * $i ) > $i ).
tff(decl_24,type,
failure_node: ( $i * $i ) > $o ).
tff(decl_25,type,
contradictory: ( $i * $i ) > $o ).
tff(decl_26,type,
siblings: ( $i * $i ) > $o ).
tff(decl_27,type,
negate: $i > $i ).
tff(decl_28,type,
left_child_of: $i > $i ).
tff(decl_29,type,
right_child_of: $i > $i ).
tff(decl_30,type,
n_left: $i ).
tff(decl_31,type,
empty: $i ).
tff(decl_32,type,
atom: $i ).
tff(decl_33,type,
n_right: $i ).
tff(decl_34,type,
n: $i ).
cnf(make_node,axiom,
( failure_node(parent_of(X1,X2),or(X3,X4))
| ~ failure_node(X1,or(X3,X5))
| ~ failure_node(X2,or(X4,X6))
| ~ contradictory(X5,X6)
| ~ siblings(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',make_node) ).
cnf(n_right_is_not_atom,hypothesis,
failure_node(n_right,or(empty,negate(atom))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_right_is_not_atom) ).
cnf(x_contradicts_not_x,axiom,
contradictory(X1,negate(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_contradicts_not_x) ).
cnf(goal_is_there_an_empty_node,negated_conjecture,
~ failure_node(X1,or(empty,empty)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_is_there_an_empty_node) ).
cnf(n_left_and_n_right_are_siblings,axiom,
siblings(left_child_of(X1),right_child_of(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_left_and_n_right_are_siblings) ).
cnf(n_right_equals_right_child_of_n,hypothesis,
n_right = right_child_of(n),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_right_equals_right_child_of_n) ).
cnf(n_left_equals_left_child_of_n,hypothesis,
n_left = left_child_of(n),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_left_equals_left_child_of_n) ).
cnf(n_left_is_atom,hypothesis,
failure_node(n_left,or(empty,atom)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_left_is_atom) ).
cnf(c_0_8,axiom,
( failure_node(parent_of(X1,X2),or(X3,X4))
| ~ failure_node(X1,or(X3,X5))
| ~ failure_node(X2,or(X4,X6))
| ~ contradictory(X5,X6)
| ~ siblings(X1,X2) ),
make_node ).
cnf(c_0_9,hypothesis,
failure_node(n_right,or(empty,negate(atom))),
n_right_is_not_atom ).
cnf(c_0_10,hypothesis,
( failure_node(parent_of(X1,n_right),or(X2,empty))
| ~ siblings(X1,n_right)
| ~ contradictory(X3,negate(atom))
| ~ failure_node(X1,or(X2,X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
contradictory(X1,negate(X1)),
x_contradicts_not_x ).
cnf(c_0_12,negated_conjecture,
~ failure_node(X1,or(empty,empty)),
goal_is_there_an_empty_node ).
cnf(c_0_13,hypothesis,
( failure_node(parent_of(X1,n_right),or(X2,empty))
| ~ siblings(X1,n_right)
| ~ failure_node(X1,or(X2,atom)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
siblings(left_child_of(X1),right_child_of(X1)),
n_left_and_n_right_are_siblings ).
cnf(c_0_15,hypothesis,
n_right = right_child_of(n),
n_right_equals_right_child_of_n ).
cnf(c_0_16,hypothesis,
n_left = left_child_of(n),
n_left_equals_left_child_of_n ).
cnf(c_0_17,negated_conjecture,
( ~ siblings(X1,n_right)
| ~ failure_node(X1,or(empty,atom)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
siblings(n_left,n_right),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,hypothesis,
failure_node(n_left,or(empty,atom)),
n_left_is_atom ).
cnf(c_0_20,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : COM004-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 13:22:16 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.59 start to proof: theBenchmark
% 0.20/0.60 % Version : CSE_E---1.5
% 0.20/0.60 % Problem : theBenchmark.p
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark.p
% 0.20/0.60 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.004000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.007000 s
%------------------------------------------------------------------------------