TSTP Solution File: ROB013-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : ROB013-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1003MB
% OS : Linux 2.6.17-1.2142_FC4
% CPULimit : 600s
% DateTime : Wed May 6 15:21:49 EDT 2009
% Result : Unsatisfiable 0.0s
% Output : Refutation 0.0s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of formulae : 10 ( 10 unt; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(robbins_axiom,plain,
! [A,B] : $equal(negate(add(negate(add(A,B)),negate(add(A,negate(B))))),A),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/ROB/ROB013-1.tptp',unknown),
[] ).
cnf(143537544,plain,
$equal(negate(add(negate(add(A,B)),negate(add(A,negate(B))))),A),
inference(rewrite,[status(thm)],[robbins_axiom]),
[] ).
fof(prove_result,plain,
~ $equal(negate(add(c,negate(add(negate(b),a)))),a),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/ROB/ROB013-1.tptp',unknown),
[] ).
cnf(143550376,plain,
~ $equal(negate(add(c,negate(add(negate(b),a)))),a),
inference(rewrite,[status(thm)],[prove_result]),
[] ).
fof(commutativity_of_add,plain,
! [B,A] : $equal(add(B,A),add(A,B)),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/ROB/ROB013-1.tptp',unknown),
[] ).
cnf(143529392,plain,
$equal(add(B,A),add(A,B)),
inference(rewrite,[status(thm)],[commutativity_of_add]),
[] ).
cnf(151394744,plain,
~ $equal(negate(add(c,negate(add(a,negate(b))))),a),
inference(paramodulation,[status(thm)],[143550376,143529392,theory(equality)]),
[] ).
fof(condition,plain,
$equal(negate(add(a,b)),c),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/ROB/ROB013-1.tptp',unknown),
[] ).
cnf(143541360,plain,
$equal(negate(add(a,b)),c),
inference(rewrite,[status(thm)],[condition]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__paramodulation,[status(thm)],[143537544,151394744,143541360,theory(equality)]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(robbins_axiom,plain,($equal(negate(add(negate(add(A,B)),negate(add(A,negate(B))))),A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/ROB/ROB013-1.tptp',unknown),[]).
%
% cnf(143537544,plain,($equal(negate(add(negate(add(A,B)),negate(add(A,negate(B))))),A)),inference(rewrite,[status(thm)],[robbins_axiom]),[]).
%
% fof(prove_result,plain,(~$equal(negate(add(c,negate(add(negate(b),a)))),a)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/ROB/ROB013-1.tptp',unknown),[]).
%
% cnf(143550376,plain,(~$equal(negate(add(c,negate(add(negate(b),a)))),a)),inference(rewrite,[status(thm)],[prove_result]),[]).
%
% fof(commutativity_of_add,plain,($equal(add(B,A),add(A,B))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/ROB/ROB013-1.tptp',unknown),[]).
%
% cnf(143529392,plain,($equal(add(B,A),add(A,B))),inference(rewrite,[status(thm)],[commutativity_of_add]),[]).
%
% cnf(151394744,plain,(~$equal(negate(add(c,negate(add(a,negate(b))))),a)),inference(paramodulation,[status(thm)],[143550376,143529392,theory(equality)]),[]).
%
% fof(condition,plain,($equal(negate(add(a,b)),c)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/ROB/ROB013-1.tptp',unknown),[]).
%
% cnf(143541360,plain,($equal(negate(add(a,b)),c)),inference(rewrite,[status(thm)],[condition]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__paramodulation,[status(thm)],[143537544,151394744,143541360,theory(equality)]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------