↑ Up

Faust---1.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : LDA003-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art09.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 13:58:14 EDT 2009

% Result   : Unsatisfiable 0.1s
% Output   : Refutation 0.1s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   16 (  16 unt;   0 def)
%            Number of atoms       :   16 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   10 (   1 sgn   5   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(a2,plain,
    ! [A,B] : left(A,f(A,B)),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LDA/LDA003-1.tptp',unknown),
    [] ).

cnf(154752192,plain,
    left(A,f(A,B)),
    inference(rewrite,[status(thm)],[a2]),
    [] ).

fof(prove_equation,plain,
    ~ left(n3,u),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LDA/LDA003-1.tptp',unknown),
    [] ).

cnf(154779768,plain,
    ~ left(n3,u),
    inference(rewrite,[status(thm)],[prove_equation]),
    [] ).

fof(clause_5,plain,
    $equal(f(n2,n1),n3),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LDA/LDA003-1.tptp',unknown),
    [] ).

cnf(154772192,plain,
    $equal(f(n2,n1),n3),
    inference(rewrite,[status(thm)],[clause_5]),
    [] ).

cnf(162625584,plain,
    ~ left(f(n2,n1),u),
    inference(paramodulation,[status(thm)],[154779768,154772192,theory(equality)]),
    [] ).

fof(clause_6,plain,
    $equal(f(n2,n2),u),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LDA/LDA003-1.tptp',unknown),
    [] ).

cnf(154775992,plain,
    $equal(f(n2,n2),u),
    inference(rewrite,[status(thm)],[clause_6]),
    [] ).

cnf(162678536,plain,
    ~ left(f(n2,n1),f(n2,n2)),
    inference(paramodulation,[status(thm)],[162625584,154775992,theory(equality)]),
    [] ).

fof(clause_4,plain,
    $equal(f(n1,n1),n2),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LDA/LDA003-1.tptp',unknown),
    [] ).

cnf(154764240,plain,
    $equal(f(n1,n1),n2),
    inference(rewrite,[status(thm)],[clause_4]),
    [] ).

cnf(162764280,plain,
    ~ left(f(n2,n1),f(n2,f(n1,n1))),
    inference(paramodulation,[status(thm)],[162678536,154764240,theory(equality)]),
    [] ).

fof(a1,plain,
    ! [A,B,C] : $equal(f(f(A,B),f(A,C)),f(A,f(B,C))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LDA/LDA003-1.tptp',unknown),
    [] ).

cnf(154747280,plain,
    $equal(f(f(A,B),f(A,C)),f(A,f(B,C))),
    inference(rewrite,[status(thm)],[a1]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__paramodulation,[status(thm)],[154752192,162764280,154747280,theory(equality)]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(a2,plain,(left(A,f(A,B))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LDA/LDA003-1.tptp',unknown),[]).
% 
% cnf(154752192,plain,(left(A,f(A,B))),inference(rewrite,[status(thm)],[a2]),[]).
% 
% fof(prove_equation,plain,(~left(n3,u)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LDA/LDA003-1.tptp',unknown),[]).
% 
% cnf(154779768,plain,(~left(n3,u)),inference(rewrite,[status(thm)],[prove_equation]),[]).
% 
% fof(clause_5,plain,($equal(f(n2,n1),n3)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LDA/LDA003-1.tptp',unknown),[]).
% 
% cnf(154772192,plain,($equal(f(n2,n1),n3)),inference(rewrite,[status(thm)],[clause_5]),[]).
% 
% cnf(162625584,plain,(~left(f(n2,n1),u)),inference(paramodulation,[status(thm)],[154779768,154772192,theory(equality)]),[]).
% 
% fof(clause_6,plain,($equal(f(n2,n2),u)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LDA/LDA003-1.tptp',unknown),[]).
% 
% cnf(154775992,plain,($equal(f(n2,n2),u)),inference(rewrite,[status(thm)],[clause_6]),[]).
% 
% cnf(162678536,plain,(~left(f(n2,n1),f(n2,n2))),inference(paramodulation,[status(thm)],[162625584,154775992,theory(equality)]),[]).
% 
% fof(clause_4,plain,($equal(f(n1,n1),n2)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LDA/LDA003-1.tptp',unknown),[]).
% 
% cnf(154764240,plain,($equal(f(n1,n1),n2)),inference(rewrite,[status(thm)],[clause_4]),[]).
% 
% cnf(162764280,plain,(~left(f(n2,n1),f(n2,f(n1,n1)))),inference(paramodulation,[status(thm)],[162678536,154764240,theory(equality)]),[]).
% 
% fof(a1,plain,($equal(f(f(A,B),f(A,C)),f(A,f(B,C)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LDA/LDA003-1.tptp',unknown),[]).
% 
% cnf(154747280,plain,($equal(f(f(A,B),f(A,C)),f(A,f(B,C)))),inference(rewrite,[status(thm)],[a1]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__paramodulation,[status(thm)],[154752192,162764280,154747280,theory(equality)]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------