TSTP Solution File: LCL506+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : LCL506+1 : TPTP v3.4.2. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art10.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:51:47 EDT 2009
% Result : Theorem 0.1s
% Output : Refutation 0.1s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of formulae : 10 ( 6 unt; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 6 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 0 con; 2-2 aty)
% Number of variables : 10 ( 2 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(kn2,plain,
! [A,B] :
( ( ~ kn2
| is_a_theorem(implies(and(A,B),A)) )
& ( kn2
| ~ is_a_theorem(implies(and(p(A,B),q(A,B)),p(A,B))) ) ),
file('/tmp/SystemOnTPTP10986/LCL506+1.p',unknown),
[] ).
cnf(151891832,plain,
( ~ kn2
| is_a_theorem(implies(and(A,B),A)) ),
inference(rewrite,[status(thm)],[kn2]),
[] ).
fof(rosser_kn2,plain,
kn2,
file('/tmp/SystemOnTPTP10986/LCL506+1.p',unknown),
[] ).
cnf(151295552,plain,
kn2,
inference(rewrite,[status(thm)],[rosser_kn2]),
[] ).
cnf(160786616,plain,
is_a_theorem(implies(and(A,B),A)),
inference(resolution,[status(thm)],[151891832,151295552]),
[] ).
fof(and_1,plain,
! [A,B] :
( ( ~ and_1
| is_a_theorem(implies(and(A,B),A)) )
& ( and_1
| ~ is_a_theorem(implies(and(x(A,B),y(A,B)),x(A,B))) ) ),
file('/tmp/SystemOnTPTP10986/LCL506+1.p',unknown),
[] ).
cnf(151541056,plain,
( and_1
| ~ is_a_theorem(implies(and(x(A,B),y(A,B)),x(A,B))) ),
inference(rewrite,[status(thm)],[and_1]),
[] ).
fof(hilbert_and_1,plain,
~ and_1,
file('/tmp/SystemOnTPTP10986/LCL506+1.p',unknown),
[] ).
cnf(152366968,plain,
~ and_1,
inference(rewrite,[status(thm)],[hilbert_and_1]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__resolution,[status(thm)],[160786616,151541056,152366968]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(kn2,plain,(((~kn2|is_a_theorem(implies(and(A,B),A)))&(kn2|~is_a_theorem(implies(and(p(A,B),q(A,B)),p(A,B)))))),file('/tmp/SystemOnTPTP10986/LCL506+1.p',unknown),[]).
%
% cnf(151891832,plain,(~kn2|is_a_theorem(implies(and(A,B),A))),inference(rewrite,[status(thm)],[kn2]),[]).
%
% fof(rosser_kn2,plain,(kn2),file('/tmp/SystemOnTPTP10986/LCL506+1.p',unknown),[]).
%
% cnf(151295552,plain,(kn2),inference(rewrite,[status(thm)],[rosser_kn2]),[]).
%
% cnf(160786616,plain,(is_a_theorem(implies(and(A,B),A))),inference(resolution,[status(thm)],[151891832,151295552]),[]).
%
% fof(and_1,plain,(((~and_1|is_a_theorem(implies(and(A,B),A)))&(and_1|~is_a_theorem(implies(and(x(A,B),y(A,B)),x(A,B)))))),file('/tmp/SystemOnTPTP10986/LCL506+1.p',unknown),[]).
%
% cnf(151541056,plain,(and_1|~is_a_theorem(implies(and(x(A,B),y(A,B)),x(A,B)))),inference(rewrite,[status(thm)],[and_1]),[]).
%
% fof(hilbert_and_1,plain,(~and_1),file('/tmp/SystemOnTPTP10986/LCL506+1.p',unknown),[]).
%
% cnf(152366968,plain,(~and_1),inference(rewrite,[status(thm)],[hilbert_and_1]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[160786616,151541056,152366968]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------