%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU629^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 : n116.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:39 EDT 2014 % Result : Theorem 0.35s % Output : Proof 0.35s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU629^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n116.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:57:26 CDT 2014 % % CPUTime : 0.35 % 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 0x263cd88>, <kernel.DependentProduct object at 0x263cc20>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x25bf5f0>, <kernel.Single object at 0x263cb48>) of role type named emptyset_type % Using role type % Declaring emptyset:fofType % FOF formula (<kernel.Constant object at 0x263cc20>, <kernel.DependentProduct object at 0x263c998>) of role type named setadjoin_type % Using role type % Declaring setadjoin:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x263c200>, <kernel.DependentProduct object at 0x20d0f80>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x263cb48>, <kernel.DependentProduct object at 0x20d0dd0>) of role type named binunion_type % Using role type % Declaring binunion:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x263cf38>, <kernel.DependentProduct object at 0x20d0f38>) of role type named kpair_type % Using role type % Declaring kpair:(fofType->(fofType->fofType)) % FOF formula (((eq (fofType->(fofType->fofType))) kpair) (fun (Xx:fofType) (Xy:fofType)=> ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset)))) of role definition named kpair % A new definition: (((eq (fofType->(fofType->fofType))) kpair) (fun (Xx:fofType) (Xy:fofType)=> ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset)))) % Defined: kpair:=(fun (Xx:fofType) (Xy:fofType)=> ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))) % FOF formula (<kernel.Constant object at 0x20d0f38>, <kernel.Sort object at 0x20c7998>) of role type named ubforcartprodlem2_type % Using role type % Declaring ubforcartprodlem2:Prop % FOF formula (((eq Prop) ubforcartprodlem2) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->((in ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))) (powerset (powerset ((binunion A) B))))))))) of role definition named ubforcartprodlem2 % A new definition: (((eq Prop) ubforcartprodlem2) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->((in ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))) (powerset (powerset ((binunion A) B))))))))) % Defined: ubforcartprodlem2:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->((in ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))) (powerset (powerset ((binunion A) B)))))))) % FOF formula (ubforcartprodlem2->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->((in ((kpair Xx) Xy)) (powerset (powerset ((binunion A) B))))))))) of role conjecture named ubforcartprodlem3 % Conjecture to prove = (ubforcartprodlem2->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->((in ((kpair Xx) Xy)) (powerset (powerset ((binunion A) B))))))))):Prop % We need to prove ['(ubforcartprodlem2->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->((in ((kpair Xx) Xy)) (powerset (powerset ((binunion A) B)))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter emptyset:fofType. % Parameter setadjoin:(fofType->(fofType->fofType)). % Parameter powerset:(fofType->fofType). % Parameter binunion:(fofType->(fofType->fofType)). % Definition kpair:=(fun (Xx:fofType) (Xy:fofType)=> ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))):(fofType->(fofType->fofType)). % Definition ubforcartprodlem2:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->((in ((setadjoin ((setadjoin Xx) emptyset)) ((setadjoin ((setadjoin Xx) ((setadjoin Xy) emptyset))) emptyset))) (powerset (powerset ((binunion A) B)))))))):Prop. % Trying to prove (ubforcartprodlem2->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->((in ((kpair Xx) Xy)) (powerset (powerset ((binunion A) B))))))))) % Found x:ubforcartprodlem2 % Found (fun (x:ubforcartprodlem2)=> x) as proof of (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->((in ((kpair Xx) Xy)) (powerset (powerset ((binunion A) B)))))))) % Found (fun (x:ubforcartprodlem2)=> x) as proof of (ubforcartprodlem2->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->((in ((kpair Xx) Xy)) (powerset (powerset ((binunion A) B))))))))) % Got proof (fun (x:ubforcartprodlem2)=> x) % Time elapsed = 0.023942s % node=1 cost=3.000000 depth=1 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:ubforcartprodlem2)=> x) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------