TSTP Solution File: COM004-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : COM004-1 : TPTP v3.4.2. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art08.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% DateTime : Wed May 6 11:36:21 EDT 2009
% Result : Unsatisfiable 0.1s
% Output : Refutation 0.1s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 21 ( 17 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 28 ( 16 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 2 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 : 21 ( 1 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(n_left_and_n_right_are_siblings,plain,
! [A] : siblings(left_child_of(A),right_child_of(A)),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),
[] ).
cnf(147532104,plain,
siblings(left_child_of(A),right_child_of(A)),
inference(rewrite,[status(thm)],[n_left_and_n_right_are_siblings]),
[] ).
fof(x_contradicts_not_x,plain,
! [A] : contradictory(A,negate(A)),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),
[] ).
cnf(147527728,plain,
contradictory(A,negate(A)),
inference(rewrite,[status(thm)],[x_contradicts_not_x]),
[] ).
fof(make_node,plain,
! [A,B,C,D,E,F] :
( failure_node(parent_of(A,B),or(C,D))
| ~ failure_node(A,or(C,E))
| ~ failure_node(B,or(D,F))
| ~ contradictory(E,F)
| ~ siblings(A,B) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),
[] ).
cnf(147514184,plain,
( failure_node(parent_of(A,B),or(C,D))
| ~ failure_node(A,or(C,E))
| ~ failure_node(B,or(D,F))
| ~ contradictory(E,F)
| ~ siblings(A,B) ),
inference(rewrite,[status(thm)],[make_node]),
[] ).
fof(n_left_is_atom,plain,
failure_node(n_left,or(empty,atom)),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),
[] ).
cnf(147536336,plain,
failure_node(n_left,or(empty,atom)),
inference(rewrite,[status(thm)],[n_left_is_atom]),
[] ).
cnf(155550792,plain,
( failure_node(parent_of(n_left,A),or(empty,B))
| ~ failure_node(A,or(B,C))
| ~ contradictory(atom,C)
| ~ siblings(n_left,A) ),
inference(resolution,[status(thm)],[147514184,147536336]),
[] ).
fof(n_right_is_not_atom,plain,
failure_node(n_right,or(empty,negate(atom))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),
[] ).
cnf(147540632,plain,
failure_node(n_right,or(empty,negate(atom))),
inference(rewrite,[status(thm)],[n_right_is_not_atom]),
[] ).
cnf(156019992,plain,
( failure_node(parent_of(n_left,n_right),or(empty,empty))
| ~ siblings(n_left,n_right) ),
inference(forward_subsumption_resolution__resolution,[status(thm)],[147527728,155550792,147540632]),
[] ).
fof(goal_is_there_an_empty_node,plain,
! [A] : ~ failure_node(A,or(empty,empty)),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),
[] ).
cnf(147558368,plain,
~ failure_node(A,or(empty,empty)),
inference(rewrite,[status(thm)],[goal_is_there_an_empty_node]),
[] ).
cnf(156211416,plain,
~ siblings(n_left,n_right),
inference(resolution,[status(thm)],[156019992,147558368]),
[] ).
fof(n_left_equals_left_child_of_n,plain,
$equal(left_child_of(n),n_left),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),
[] ).
cnf(147545288,plain,
$equal(left_child_of(n),n_left),
inference(rewrite,[status(thm)],[n_left_equals_left_child_of_n]),
[] ).
cnf(156226504,plain,
~ siblings(left_child_of(n),n_right),
inference(paramodulation,[status(thm)],[156211416,147545288,theory(equality)]),
[] ).
fof(n_right_equals_right_child_of_n,plain,
$equal(right_child_of(n),n_right),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),
[] ).
cnf(147553616,plain,
$equal(right_child_of(n),n_right),
inference(rewrite,[status(thm)],[n_right_equals_right_child_of_n]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__paramodulation,[status(thm)],[147532104,156226504,147553616,theory(equality)]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(n_left_and_n_right_are_siblings,plain,(siblings(left_child_of(A),right_child_of(A))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),[]).
%
% cnf(147532104,plain,(siblings(left_child_of(A),right_child_of(A))),inference(rewrite,[status(thm)],[n_left_and_n_right_are_siblings]),[]).
%
% fof(x_contradicts_not_x,plain,(contradictory(A,negate(A))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),[]).
%
% cnf(147527728,plain,(contradictory(A,negate(A))),inference(rewrite,[status(thm)],[x_contradicts_not_x]),[]).
%
% fof(make_node,plain,(failure_node(parent_of(A,B),or(C,D))|~failure_node(A,or(C,E))|~failure_node(B,or(D,F))|~contradictory(E,F)|~siblings(A,B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),[]).
%
% cnf(147514184,plain,(failure_node(parent_of(A,B),or(C,D))|~failure_node(A,or(C,E))|~failure_node(B,or(D,F))|~contradictory(E,F)|~siblings(A,B)),inference(rewrite,[status(thm)],[make_node]),[]).
%
% fof(n_left_is_atom,plain,(failure_node(n_left,or(empty,atom))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),[]).
%
% cnf(147536336,plain,(failure_node(n_left,or(empty,atom))),inference(rewrite,[status(thm)],[n_left_is_atom]),[]).
%
% cnf(155550792,plain,(failure_node(parent_of(n_left,A),or(empty,B))|~failure_node(A,or(B,C))|~contradictory(atom,C)|~siblings(n_left,A)),inference(resolution,[status(thm)],[147514184,147536336]),[]).
%
% fof(n_right_is_not_atom,plain,(failure_node(n_right,or(empty,negate(atom)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),[]).
%
% cnf(147540632,plain,(failure_node(n_right,or(empty,negate(atom)))),inference(rewrite,[status(thm)],[n_right_is_not_atom]),[]).
%
% cnf(156019992,plain,(failure_node(parent_of(n_left,n_right),or(empty,empty))|~siblings(n_left,n_right)),inference(forward_subsumption_resolution__resolution,[status(thm)],[147527728,155550792,147540632]),[]).
%
% fof(goal_is_there_an_empty_node,plain,(~failure_node(A,or(empty,empty))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),[]).
%
% cnf(147558368,plain,(~failure_node(A,or(empty,empty))),inference(rewrite,[status(thm)],[goal_is_there_an_empty_node]),[]).
%
% cnf(156211416,plain,(~siblings(n_left,n_right)),inference(resolution,[status(thm)],[156019992,147558368]),[]).
%
% fof(n_left_equals_left_child_of_n,plain,($equal(left_child_of(n),n_left)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),[]).
%
% cnf(147545288,plain,($equal(left_child_of(n),n_left)),inference(rewrite,[status(thm)],[n_left_equals_left_child_of_n]),[]).
%
% cnf(156226504,plain,(~siblings(left_child_of(n),n_right)),inference(paramodulation,[status(thm)],[156211416,147545288,theory(equality)]),[]).
%
% fof(n_right_equals_right_child_of_n,plain,($equal(right_child_of(n),n_right)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COM/COM004-1.tptp',unknown),[]).
%
% cnf(147553616,plain,($equal(right_child_of(n),n_right)),inference(rewrite,[status(thm)],[n_right_equals_right_child_of_n]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__paramodulation,[status(thm)],[147532104,156226504,147553616,theory(equality)]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------