TSTP Solution File: SEU924^5 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU924^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 : n118.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:23 EDT 2014
% Result : Theorem 1.03s
% Output : Proof 1.03s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEU924^5 : TPTP v6.1.0. Released v4.0.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n118.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 11:43:01 CDT 2014
% % CPUTime : 1.03
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% FOF formula (forall (Xz:fofType) (Xg:(fofType->fofType)), ((forall (Xp:((fofType->fofType)->Prop)), (((and (Xp (fun (Xx:fofType)=> Xz))) (forall (Xj:(fofType->fofType)), ((Xp Xj)->(Xp (fun (Xx:fofType)=> Xz)))))->(Xp Xg)))->(forall (Xx:fofType), (((eq fofType) (Xg Xx)) Xz)))) of role conjecture named cTHM134_pme
% Conjecture to prove = (forall (Xz:fofType) (Xg:(fofType->fofType)), ((forall (Xp:((fofType->fofType)->Prop)), (((and (Xp (fun (Xx:fofType)=> Xz))) (forall (Xj:(fofType->fofType)), ((Xp Xj)->(Xp (fun (Xx:fofType)=> Xz)))))->(Xp Xg)))->(forall (Xx:fofType), (((eq fofType) (Xg Xx)) Xz)))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(forall (Xz:fofType) (Xg:(fofType->fofType)), ((forall (Xp:((fofType->fofType)->Prop)), (((and (Xp (fun (Xx:fofType)=> Xz))) (forall (Xj:(fofType->fofType)), ((Xp Xj)->(Xp (fun (Xx:fofType)=> Xz)))))->(Xp Xg)))->(forall (Xx:fofType), (((eq fofType) (Xg Xx)) Xz))))']
% Parameter fofType:Type.
% Trying to prove (forall (Xz:fofType) (Xg:(fofType->fofType)), ((forall (Xp:((fofType->fofType)->Prop)), (((and (Xp (fun (Xx:fofType)=> Xz))) (forall (Xj:(fofType->fofType)), ((Xp Xj)->(Xp (fun (Xx:fofType)=> Xz)))))->(Xp Xg)))->(forall (Xx:fofType), (((eq fofType) (Xg Xx)) Xz))))
% Found eq_ref00:=(eq_ref0 Xz):(((eq fofType) Xz) Xz)
% Found (eq_ref0 Xz) as proof of (((eq fofType) Xz) Xz)
% Found ((eq_ref fofType) Xz) as proof of (((eq fofType) Xz) Xz)
% Found ((eq_ref fofType) Xz) as proof of (((eq fofType) Xz) Xz)
% Found eq_substitution00000:=(eq_substitution0000 (fun (x3:fofType)=> Xz)):((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz))
% Found (eq_substitution0000 (fun (x3:fofType)=> Xz)) as proof of ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz))
% Found ((eq_substitution000 Xz) (fun (x3:fofType)=> Xz)) as proof of ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz))
% Found (((eq_substitution00 (Xj Xx)) Xz) (fun (x3:fofType)=> Xz)) as proof of ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz))
% Found ((((eq_substitution0 fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz)) as proof of ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz))
% Found (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz)) as proof of ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz))
% Found (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz))) as proof of ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz))
% Found (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz))) as proof of (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz)))
% Found ((conj00 ((eq_ref fofType) Xz)) (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz)))) as proof of ((and (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz))))
% Found (((conj0 (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz)))) ((eq_ref fofType) Xz)) (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz)))) as proof of ((and (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz))))
% Found ((((conj (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz)))) ((eq_ref fofType) Xz)) (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz)))) as proof of ((and (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz))))
% Found ((((conj (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz)))) ((eq_ref fofType) Xz)) (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz)))) as proof of ((and (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz))))
% Found (x0 ((((conj (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz)))) ((eq_ref fofType) Xz)) (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz))))) as proof of (((eq fofType) (Xg Xx)) Xz)
% Found ((x (fun (x1:(fofType->fofType))=> (((eq fofType) (x1 Xx)) Xz))) ((((conj (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz)))) ((eq_ref fofType) Xz)) (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz))))) as proof of (((eq fofType) (Xg Xx)) Xz)
% Found (fun (Xx:fofType)=> ((x (fun (x1:(fofType->fofType))=> (((eq fofType) (x1 Xx)) Xz))) ((((conj (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz)))) ((eq_ref fofType) Xz)) (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz)))))) as proof of (((eq fofType) (Xg Xx)) Xz)
% Found (fun (x:(forall (Xp:((fofType->fofType)->Prop)), (((and (Xp (fun (Xx:fofType)=> Xz))) (forall (Xj:(fofType->fofType)), ((Xp Xj)->(Xp (fun (Xx:fofType)=> Xz)))))->(Xp Xg)))) (Xx:fofType)=> ((x (fun (x1:(fofType->fofType))=> (((eq fofType) (x1 Xx)) Xz))) ((((conj (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz)))) ((eq_ref fofType) Xz)) (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz)))))) as proof of (forall (Xx:fofType), (((eq fofType) (Xg Xx)) Xz))
% Found (fun (Xg:(fofType->fofType)) (x:(forall (Xp:((fofType->fofType)->Prop)), (((and (Xp (fun (Xx:fofType)=> Xz))) (forall (Xj:(fofType->fofType)), ((Xp Xj)->(Xp (fun (Xx:fofType)=> Xz)))))->(Xp Xg)))) (Xx:fofType)=> ((x (fun (x1:(fofType->fofType))=> (((eq fofType) (x1 Xx)) Xz))) ((((conj (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz)))) ((eq_ref fofType) Xz)) (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz)))))) as proof of ((forall (Xp:((fofType->fofType)->Prop)), (((and (Xp (fun (Xx:fofType)=> Xz))) (forall (Xj:(fofType->fofType)), ((Xp Xj)->(Xp (fun (Xx:fofType)=> Xz)))))->(Xp Xg)))->(forall (Xx:fofType), (((eq fofType) (Xg Xx)) Xz)))
% Found (fun (Xz:fofType) (Xg:(fofType->fofType)) (x:(forall (Xp:((fofType->fofType)->Prop)), (((and (Xp (fun (Xx:fofType)=> Xz))) (forall (Xj:(fofType->fofType)), ((Xp Xj)->(Xp (fun (Xx:fofType)=> Xz)))))->(Xp Xg)))) (Xx:fofType)=> ((x (fun (x1:(fofType->fofType))=> (((eq fofType) (x1 Xx)) Xz))) ((((conj (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz)))) ((eq_ref fofType) Xz)) (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz)))))) as proof of (forall (Xg:(fofType->fofType)), ((forall (Xp:((fofType->fofType)->Prop)), (((and (Xp (fun (Xx:fofType)=> Xz))) (forall (Xj:(fofType->fofType)), ((Xp Xj)->(Xp (fun (Xx:fofType)=> Xz)))))->(Xp Xg)))->(forall (Xx:fofType), (((eq fofType) (Xg Xx)) Xz))))
% Found (fun (Xz:fofType) (Xg:(fofType->fofType)) (x:(forall (Xp:((fofType->fofType)->Prop)), (((and (Xp (fun (Xx:fofType)=> Xz))) (forall (Xj:(fofType->fofType)), ((Xp Xj)->(Xp (fun (Xx:fofType)=> Xz)))))->(Xp Xg)))) (Xx:fofType)=> ((x (fun (x1:(fofType->fofType))=> (((eq fofType) (x1 Xx)) Xz))) ((((conj (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz)))) ((eq_ref fofType) Xz)) (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz)))))) as proof of (forall (Xz:fofType) (Xg:(fofType->fofType)), ((forall (Xp:((fofType->fofType)->Prop)), (((and (Xp (fun (Xx:fofType)=> Xz))) (forall (Xj:(fofType->fofType)), ((Xp Xj)->(Xp (fun (Xx:fofType)=> Xz)))))->(Xp Xg)))->(forall (Xx:fofType), (((eq fofType) (Xg Xx)) Xz))))
% Got proof (fun (Xz:fofType) (Xg:(fofType->fofType)) (x:(forall (Xp:((fofType->fofType)->Prop)), (((and (Xp (fun (Xx:fofType)=> Xz))) (forall (Xj:(fofType->fofType)), ((Xp Xj)->(Xp (fun (Xx:fofType)=> Xz)))))->(Xp Xg)))) (Xx:fofType)=> ((x (fun (x1:(fofType->fofType))=> (((eq fofType) (x1 Xx)) Xz))) ((((conj (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz)))) ((eq_ref fofType) Xz)) (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz))))))
% Time elapsed = 0.718594s
% node=119 cost=-218.000000 depth=17
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (Xz:fofType) (Xg:(fofType->fofType)) (x:(forall (Xp:((fofType->fofType)->Prop)), (((and (Xp (fun (Xx:fofType)=> Xz))) (forall (Xj:(fofType->fofType)), ((Xp Xj)->(Xp (fun (Xx:fofType)=> Xz)))))->(Xp Xg)))) (Xx:fofType)=> ((x (fun (x1:(fofType->fofType))=> (((eq fofType) (x1 Xx)) Xz))) ((((conj (((eq fofType) Xz) Xz)) (forall (Xj:(fofType->fofType)), ((((eq fofType) (Xj Xx)) Xz)->(((eq fofType) Xz) Xz)))) ((eq_ref fofType) Xz)) (fun (Xj:(fofType->fofType))=> (((((eq_substitution fofType) fofType) (Xj Xx)) Xz) (fun (x3:fofType)=> Xz))))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------