↑ Up

cocATP---0.2.0.THM-Prf.s

View TPTP
Problem Process solution in
SystemOnTSTP Download .tgz 
%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEV012^5 : TPTP v6.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n102.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32286.75MB
% OS       : Linux 2.6.32-431.20.3.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 17 13:33:33 EDT 2014

% Result   : Theorem 0.55s
% Output   : Proof 0.55s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEV012^5 : TPTP v6.1.0. Released v4.0.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n102.star.cs.uiowa.edu
% % Model    : x86_64 x86_64
% % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory   : 32286.75MB
% % OS       : Linux 2.6.32-431.20.3.el6.x86_64
% % CPULimit : 300
% % DateTime : Thu Jul 17 07:28:36 CDT 2014
% % CPUTime  : 0.55 
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% FOF formula ((and ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))) (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True))) of role conjecture named cTHM519_pme
% Conjecture to prove = ((and ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))) (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True))):Prop
% We need to prove ['((and ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))) (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True)))']
% Trying to prove ((and ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))) (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True)))
% Found eq_ref00:=(eq_ref0 (fun (Xx:Prop) (Xy:Prop)=> True)):(((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True))
% Found (eq_ref0 (fun (Xx:Prop) (Xy:Prop)=> True)) as proof of (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True))
% Found ((eq_ref (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) as proof of (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True))
% Found ((eq_ref (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) as proof of (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True))
% Found x:True
% Found (fun (x:True)=> x) as proof of True
% Found (fun (Xy:Prop) (x:True)=> x) as proof of (True->True)
% Found (fun (Xx:Prop) (Xy:Prop) (x:True)=> x) as proof of (Prop->(True->True))
% Found (fun (Xx:Prop) (Xy:Prop) (x:True)=> x) as proof of (Prop->(Prop->(True->True)))
% Found I:True
% Found (fun (x:((and True) True))=> I) as proof of True
% Found (fun (Xz:Prop) (x:((and True) True))=> I) as proof of (((and True) True)->True)
% Found (fun (Xy:Prop) (Xz:Prop) (x:((and True) True))=> I) as proof of (Prop->(((and True) True)->True))
% Found (fun (Xx:Prop) (Xy:Prop) (Xz:Prop) (x:((and True) True))=> I) as proof of (Prop->(Prop->(((and True) True)->True)))
% Found (fun (Xx:Prop) (Xy:Prop) (Xz:Prop) (x:((and True) True))=> I) as proof of (Prop->(Prop->(Prop->(((and True) True)->True))))
% Found ((conj10 (fun (Xx:Prop) (Xy:Prop) (x:True)=> x)) (fun (Xx:Prop) (Xy:Prop) (Xz:Prop) (x:((and True) True))=> I)) as proof of ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))
% Found (((conj1 (Prop->(Prop->(Prop->(((and True) True)->True))))) (fun (Xx:Prop) (Xy:Prop) (x:True)=> x)) (fun (Xx:Prop) (Xy:Prop) (Xz:Prop) (x:((and True) True))=> I)) as proof of ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))
% Found ((((conj (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True))))) (fun (Xx:Prop) (Xy:Prop) (x:True)=> x)) (fun (Xx:Prop) (Xy:Prop) (Xz:Prop) (x:((and True) True))=> I)) as proof of ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))
% Found ((((conj (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True))))) (fun (Xx:Prop) (Xy:Prop) (x:True)=> x)) (fun (Xx:Prop) (Xy:Prop) (Xz:Prop) (x:((and True) True))=> I)) as proof of ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))
% Found ((conj00 ((((conj (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True))))) (fun (Xx:Prop) (Xy:Prop) (x:True)=> x)) (fun (Xx:Prop) (Xy:Prop) (Xz:Prop) (x:((and True) True))=> I))) ((eq_ref (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True))) as proof of ((and ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))) (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True)))
% Found (((conj0 (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True))) ((((conj (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True))))) (fun (Xx:Prop) (Xy:Prop) (x:True)=> x)) (fun (Xx:Prop) (Xy:Prop) (Xz:Prop) (x:((and True) True))=> I))) ((eq_ref (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True))) as proof of ((and ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))) (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True)))
% Found ((((conj ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))) (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True))) ((((conj (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True))))) (fun (Xx:Prop) (Xy:Prop) (x:True)=> x)) (fun (Xx:Prop) (Xy:Prop) (Xz:Prop) (x:((and True) True))=> I))) ((eq_ref (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True))) as proof of ((and ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))) (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True)))
% Found ((((conj ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))) (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True))) ((((conj (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True))))) (fun (Xx:Prop) (Xy:Prop) (x:True)=> x)) (fun (Xx:Prop) (Xy:Prop) (Xz:Prop) (x:((and True) True))=> I))) ((eq_ref (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True))) as proof of ((and ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))) (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True)))
% Got proof ((((conj ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))) (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True))) ((((conj (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True))))) (fun (Xx:Prop) (Xy:Prop) (x:True)=> x)) (fun (Xx:Prop) (Xy:Prop) (Xz:Prop) (x:((and True) True))=> I))) ((eq_ref (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)))
% Time elapsed = 0.237684s
% node=38 cost=264.000000 depth=12
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% ((((conj ((and (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True)))))) (((eq (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)) (fun (Xx:Prop) (Xy:Prop)=> True))) ((((conj (Prop->(Prop->(True->True)))) (Prop->(Prop->(Prop->(((and True) True)->True))))) (fun (Xx:Prop) (Xy:Prop) (x:True)=> x)) (fun (Xx:Prop) (Xy:Prop) (Xz:Prop) (x:((and True) True))=> I))) ((eq_ref (Prop->(Prop->Prop))) (fun (Xx:Prop) (Xy:Prop)=> True)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------