↑ Up

cocATP---0.2.0.THM-Prf.s

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

% Computer : n089.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:32:27 EDT 2014

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

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU552^2 : TPTP v6.1.0. Bugfixed v4.0.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n089.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 10:41:06 CDT 2014
% % CPUTime  : 0.74 
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% FOF formula (<kernel.Constant object at 0x150f170>, <kernel.DependentProduct object at 0x150e7e8>) of role type named setadjoin
% Using role type
% Declaring setadjoin:(fofType->(fofType->fofType))
% FOF formula (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->(forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xy) Xu)))))) of role conjecture named setadjoin__Cong
% Conjecture to prove = (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->(forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xy) Xu)))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->(forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xy) Xu))))))']
% Parameter fofType:Type.
% Parameter setadjoin:(fofType->(fofType->fofType)).
% Trying to prove (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->(forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xy) Xu))))))
% Found eq_substitution00000:=(eq_substitution0000 (setadjoin Xx)):((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xx) Xu)))
% Found (eq_substitution0000 (setadjoin Xx)) as proof of ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xx) Xu)))
% Found ((eq_substitution000 Xu) (setadjoin Xx)) as proof of ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xx) Xu)))
% Found (((eq_substitution00 Xz) Xu) (setadjoin Xx)) as proof of ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xx) Xu)))
% Found ((((eq_substitution0 fofType) Xz) Xu) (setadjoin Xx)) as proof of ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xx) Xu)))
% Found (((((eq_substitution fofType) fofType) Xz) Xu) (setadjoin Xx)) as proof of ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xx) Xu)))
% Found (fun (Xu:fofType)=> (((((eq_substitution fofType) fofType) Xz) Xu) (setadjoin Xx))) as proof of ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xx) Xu)))
% Found (fun (Xz:fofType) (Xu:fofType)=> (((((eq_substitution fofType) fofType) Xz) Xu) (setadjoin Xx))) as proof of (forall (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xx) Xu))))
% Found (fun (Xz:fofType) (Xu:fofType)=> (((((eq_substitution fofType) fofType) Xz) Xu) (setadjoin Xx))) as proof of (forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xx) Xu))))
% Found (x0 (fun (Xz:fofType) (Xu:fofType)=> (((((eq_substitution fofType) fofType) Xz) Xu) (setadjoin Xx)))) as proof of (forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xy) Xu))))
% Found ((x (fun (x1:fofType)=> (forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin x1) Xu)))))) (fun (Xz:fofType) (Xu:fofType)=> (((((eq_substitution fofType) fofType) Xz) Xu) (setadjoin Xx)))) as proof of (forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xy) Xu))))
% Found (fun (x:(((eq fofType) Xx) Xy))=> ((x (fun (x1:fofType)=> (forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin x1) Xu)))))) (fun (Xz:fofType) (Xu:fofType)=> (((((eq_substitution fofType) fofType) Xz) Xu) (setadjoin Xx))))) as proof of (forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xy) Xu))))
% Found (fun (Xy:fofType) (x:(((eq fofType) Xx) Xy))=> ((x (fun (x1:fofType)=> (forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin x1) Xu)))))) (fun (Xz:fofType) (Xu:fofType)=> (((((eq_substitution fofType) fofType) Xz) Xu) (setadjoin Xx))))) as proof of ((((eq fofType) Xx) Xy)->(forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xy) Xu)))))
% Found (fun (Xx:fofType) (Xy:fofType) (x:(((eq fofType) Xx) Xy))=> ((x (fun (x1:fofType)=> (forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin x1) Xu)))))) (fun (Xz:fofType) (Xu:fofType)=> (((((eq_substitution fofType) fofType) Xz) Xu) (setadjoin Xx))))) as proof of (forall (Xy:fofType), ((((eq fofType) Xx) Xy)->(forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xy) Xu))))))
% Found (fun (Xx:fofType) (Xy:fofType) (x:(((eq fofType) Xx) Xy))=> ((x (fun (x1:fofType)=> (forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin x1) Xu)))))) (fun (Xz:fofType) (Xu:fofType)=> (((((eq_substitution fofType) fofType) Xz) Xu) (setadjoin Xx))))) as proof of (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->(forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin Xy) Xu))))))
% Got proof (fun (Xx:fofType) (Xy:fofType) (x:(((eq fofType) Xx) Xy))=> ((x (fun (x1:fofType)=> (forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin x1) Xu)))))) (fun (Xz:fofType) (Xu:fofType)=> (((((eq_substitution fofType) fofType) Xz) Xu) (setadjoin Xx)))))
% Time elapsed = 0.428390s
% node=43 cost=-379.000000 depth=13
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (Xx:fofType) (Xy:fofType) (x:(((eq fofType) Xx) Xy))=> ((x (fun (x1:fofType)=> (forall (Xz:fofType) (Xu:fofType), ((((eq fofType) Xz) Xu)->(((eq fofType) ((setadjoin Xx) Xz)) ((setadjoin x1) Xu)))))) (fun (Xz:fofType) (Xu:fofType)=> (((((eq_substitution fofType) fofType) Xz) Xu) (setadjoin Xx)))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------