TSTP Solution File: SEU618^2 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU618^2 : TPTP v6.1.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n190.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:37 EDT 2014
% Result : Theorem 0.44s
% Output : Proof 0.44s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEU618^2 : TPTP v6.1.0. Released v3.7.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n190.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:54:41 CDT 2014
% % CPUTime : 0.44
% 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 0x21815a8>, <kernel.DependentProduct object at 0x2181200>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x1c14488>, <kernel.Single object at 0x2181560>) of role type named emptyset_type
% Using role type
% Declaring emptyset:fofType
% FOF formula (<kernel.Constant object at 0x2181200>, <kernel.DependentProduct object at 0x2181cf8>) of role type named setadjoin_type
% Using role type
% Declaring setadjoin:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x2181878>, <kernel.DependentProduct object at 0x21817a0>) of role type named setunion_type
% Using role type
% Declaring setunion:(fofType->fofType)
% FOF formula (<kernel.Constant object at 0x2181a70>, <kernel.Sort object at 0x1c1b638>) of role type named setunionI_type
% Using role type
% Declaring setunionI:Prop
% FOF formula (((eq Prop) setunionI) (forall (A:fofType) (Xx:fofType) (B:fofType), (((in Xx) B)->(((in B) A)->((in Xx) (setunion A)))))) of role definition named setunionI
% A new definition: (((eq Prop) setunionI) (forall (A:fofType) (Xx:fofType) (B:fofType), (((in Xx) B)->(((in B) A)->((in Xx) (setunion A))))))
% Defined: setunionI:=(forall (A:fofType) (Xx:fofType) (B:fofType), (((in Xx) B)->(((in B) A)->((in Xx) (setunion A)))))
% FOF formula (<kernel.Constant object at 0x1f3e290>, <kernel.Sort object at 0x1c1b638>) of role type named secondinupair_type
% Using role type
% Declaring secondinupair:Prop
% FOF formula (((eq Prop) secondinupair) (forall (Xx:fofType) (Xy:fofType), ((in Xy) ((setadjoin Xx) ((setadjoin Xy) emptyset))))) of role definition named secondinupair
% A new definition: (((eq Prop) secondinupair) (forall (Xx:fofType) (Xy:fofType), ((in Xy) ((setadjoin Xx) ((setadjoin Xy) emptyset)))))
% Defined: secondinupair:=(forall (Xx:fofType) (Xy:fofType), ((in Xy) ((setadjoin Xx) ((setadjoin Xy) emptyset))))
% FOF formula (setunionI->(secondinupair->(forall (Xx:fofType) (Xy:fofType), ((in Xy) (setunion ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))))))) of role conjecture named setukpairIR
% Conjecture to prove = (setunionI->(secondinupair->(forall (Xx:fofType) (Xy:fofType), ((in Xy) (setunion ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))))))):Prop
% We need to prove ['(setunionI->(secondinupair->(forall (Xx:fofType) (Xy:fofType), ((in Xy) (setunion ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset)))))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter emptyset:fofType.
% Parameter setadjoin:(fofType->(fofType->fofType)).
% Parameter setunion:(fofType->fofType).
% Definition setunionI:=(forall (A:fofType) (Xx:fofType) (B:fofType), (((in Xx) B)->(((in B) A)->((in Xx) (setunion A))))):Prop.
% Definition secondinupair:=(forall (Xx:fofType) (Xy:fofType), ((in Xy) ((setadjoin Xx) ((setadjoin Xy) emptyset)))):Prop.
% Trying to prove (setunionI->(secondinupair->(forall (Xx:fofType) (Xy:fofType), ((in Xy) (setunion ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset)))))))
% Found x000:=(x00 B):((in B) ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin B) emptyset)))
% Found (x00 B) as proof of ((in B) ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset)))
% Found ((x0 ((setadjoin Xx) emptyset)) B) as proof of ((in B) ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset)))
% Found ((x0 ((setadjoin Xx) emptyset)) B) as proof of ((in B) ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset)))
% Found ((x0 ((setadjoin Xx) emptyset)) B) as proof of ((in B) ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset)))
% Found x000:=(x00 Xy):((in Xy) ((setadjoin Xx) ((setadjoin Xy) emptyset)))
% Found (x00 Xy) as proof of ((in Xy) B)
% Found ((x0 Xx) Xy) as proof of ((in Xy) B)
% Found ((x0 Xx) Xy) as proof of ((in Xy) B)
% Found ((x100 ((x0 Xx) Xy)) ((x0 ((setadjoin Xx) emptyset)) B)) as proof of ((in Xy) (setunion ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))))
% Found (((x10 ((setadjoin Xx) ((setadjoin Xy) emptyset))) ((x0 Xx) Xy)) ((x0 ((setadjoin Xx) emptyset)) ((setadjoin Xx) ((setadjoin Xy) emptyset)))) as proof of ((in Xy) (setunion ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))))
% Found ((((x1 Xy) ((setadjoin Xx) ((setadjoin Xy) emptyset))) ((x0 Xx) Xy)) ((x0 ((setadjoin Xx) emptyset)) ((setadjoin Xx) ((setadjoin Xy) emptyset)))) as proof of ((in Xy) (setunion ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))))
% Found (((((x ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))) Xy) ((setadjoin Xx) ((setadjoin Xy) emptyset))) ((x0 Xx) Xy)) ((x0 ((setadjoin Xx) emptyset)) ((setadjoin Xx) ((setadjoin Xy) emptyset)))) as proof of ((in Xy) (setunion ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))))
% Found (fun (Xy:fofType)=> (((((x ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))) Xy) ((setadjoin Xx) ((setadjoin Xy) emptyset))) ((x0 Xx) Xy)) ((x0 ((setadjoin Xx) emptyset)) ((setadjoin Xx) ((setadjoin Xy) emptyset))))) as proof of ((in Xy) (setunion ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))))
% Found (fun (Xx:fofType) (Xy:fofType)=> (((((x ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))) Xy) ((setadjoin Xx) ((setadjoin Xy) emptyset))) ((x0 Xx) Xy)) ((x0 ((setadjoin Xx) emptyset)) ((setadjoin Xx) ((setadjoin Xy) emptyset))))) as proof of (forall (Xy:fofType), ((in Xy) (setunion ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset)))))
% Found (fun (x0:secondinupair) (Xx:fofType) (Xy:fofType)=> (((((x ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))) Xy) ((setadjoin Xx) ((setadjoin Xy) emptyset))) ((x0 Xx) Xy)) ((x0 ((setadjoin Xx) emptyset)) ((setadjoin Xx) ((setadjoin Xy) emptyset))))) as proof of (forall (Xx:fofType) (Xy:fofType), ((in Xy) (setunion ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset)))))
% Found (fun (x:setunionI) (x0:secondinupair) (Xx:fofType) (Xy:fofType)=> (((((x ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))) Xy) ((setadjoin Xx) ((setadjoin Xy) emptyset))) ((x0 Xx) Xy)) ((x0 ((setadjoin Xx) emptyset)) ((setadjoin Xx) ((setadjoin Xy) emptyset))))) as proof of (secondinupair->(forall (Xx:fofType) (Xy:fofType), ((in Xy) (setunion ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))))))
% Found (fun (x:setunionI) (x0:secondinupair) (Xx:fofType) (Xy:fofType)=> (((((x ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))) Xy) ((setadjoin Xx) ((setadjoin Xy) emptyset))) ((x0 Xx) Xy)) ((x0 ((setadjoin Xx) emptyset)) ((setadjoin Xx) ((setadjoin Xy) emptyset))))) as proof of (setunionI->(secondinupair->(forall (Xx:fofType) (Xy:fofType), ((in Xy) (setunion ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset)))))))
% Got proof (fun (x:setunionI) (x0:secondinupair) (Xx:fofType) (Xy:fofType)=> (((((x ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))) Xy) ((setadjoin Xx) ((setadjoin Xy) emptyset))) ((x0 Xx) Xy)) ((x0 ((setadjoin Xx) emptyset)) ((setadjoin Xx) ((setadjoin Xy) emptyset)))))
% Time elapsed = 0.116294s
% node=20 cost=24.000000 depth=11
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:setunionI) (x0:secondinupair) (Xx:fofType) (Xy:fofType)=> (((((x ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))) Xy) ((setadjoin Xx) ((setadjoin Xy) emptyset))) ((x0 Xx) Xy)) ((x0 ((setadjoin Xx) emptyset)) ((setadjoin Xx) ((setadjoin Xy) emptyset)))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------