%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU582^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 : n091.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:31 EDT 2014 % Result : Theorem 0.43s % Output : Proof 0.43s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU582^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n091.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:48:06 CDT 2014 % % CPUTime : 0.43 % 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 0x1658758>, <kernel.DependentProduct object at 0x1658c68>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x18eb680>, <kernel.Single object at 0x1658a70>) of role type named emptyset_type % Using role type % Declaring emptyset:fofType % FOF formula (<kernel.Constant object at 0x1658c68>, <kernel.DependentProduct object at 0x16585f0>) of role type named setadjoin_type % Using role type % Declaring setadjoin:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x1658998>, <kernel.DependentProduct object at 0x16587e8>) of role type named setunion_type % Using role type % Declaring setunion:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x1658a28>, <kernel.Sort object at 0x151d368>) of role type named setadjoinIL_type % Using role type % Declaring setadjoinIL:Prop % FOF formula (((eq Prop) setadjoinIL) (forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) Xy)))) of role definition named setadjoinIL % A new definition: (((eq Prop) setadjoinIL) (forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) Xy)))) % Defined: setadjoinIL:=(forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) Xy))) % FOF formula (<kernel.Constant object at 0x1658878>, <kernel.Sort object at 0x151d368>) 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 0x1658998>, <kernel.DependentProduct object at 0x1658c68>) of role type named binunion_type % Using role type % Declaring binunion:(fofType->(fofType->fofType)) % FOF formula (((eq (fofType->(fofType->fofType))) binunion) (fun (Xx:fofType) (Xy:fofType)=> (setunion ((setadjoin Xx) ((setadjoin Xy) emptyset))))) of role definition named binunion % A new definition: (((eq (fofType->(fofType->fofType))) binunion) (fun (Xx:fofType) (Xy:fofType)=> (setunion ((setadjoin Xx) ((setadjoin Xy) emptyset))))) % Defined: binunion:=(fun (Xx:fofType) (Xy:fofType)=> (setunion ((setadjoin Xx) ((setadjoin Xy) emptyset)))) % FOF formula (setadjoinIL->(setunionI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))))) of role conjecture named binunionIL % Conjecture to prove = (setadjoinIL->(setunionI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))))):Prop % We need to prove ['(setadjoinIL->(setunionI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter emptyset:fofType. % Parameter setadjoin:(fofType->(fofType->fofType)). % Parameter setunion:(fofType->fofType). % Definition setadjoinIL:=(forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) Xy))):Prop. % Definition setunionI:=(forall (A:fofType) (Xx:fofType) (B:fofType), (((in Xx) B)->(((in B) A)->((in Xx) (setunion A))))):Prop. % Definition binunion:=(fun (Xx:fofType) (Xy:fofType)=> (setunion ((setadjoin Xx) ((setadjoin Xy) emptyset)))):(fofType->(fofType->fofType)). % Trying to prove (setadjoinIL->(setunionI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))))) % Found x20:=(x2 ((setadjoin B) emptyset)):((in A) ((setadjoin A) ((setadjoin B) emptyset))) % Found (x2 ((setadjoin B) emptyset)) as proof of ((in A) ((setadjoin A) ((setadjoin B) emptyset))) % Found ((x A) ((setadjoin B) emptyset)) as proof of ((in A) ((setadjoin A) ((setadjoin B) emptyset))) % Found ((x A) ((setadjoin B) emptyset)) as proof of ((in A) ((setadjoin A) ((setadjoin B) emptyset))) % Found (x00000 ((x A) ((setadjoin B) emptyset))) as proof of ((in Xx) ((binunion A) B)) % Found ((x0000 x1) ((x A) ((setadjoin B) emptyset))) as proof of ((in Xx) ((binunion A) B)) % Found (((x000 A) x1) ((x A) ((setadjoin B) emptyset))) as proof of ((in Xx) ((binunion A) B)) % Found ((((x00 Xx) A) x1) ((x A) ((setadjoin B) emptyset))) as proof of ((in Xx) ((binunion A) B)) % Found (((((x0 ((setadjoin A) ((setadjoin B) emptyset))) Xx) A) x1) ((x A) ((setadjoin B) emptyset))) as proof of ((in Xx) ((binunion A) B)) % Found (fun (x1:((in Xx) A))=> (((((x0 ((setadjoin A) ((setadjoin B) emptyset))) Xx) A) x1) ((x A) ((setadjoin B) emptyset)))) as proof of ((in Xx) ((binunion A) B)) % Found (fun (Xx:fofType) (x1:((in Xx) A))=> (((((x0 ((setadjoin A) ((setadjoin B) emptyset))) Xx) A) x1) ((x A) ((setadjoin B) emptyset)))) as proof of (((in Xx) A)->((in Xx) ((binunion A) B))) % Found (fun (B:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((((x0 ((setadjoin A) ((setadjoin B) emptyset))) Xx) A) x1) ((x A) ((setadjoin B) emptyset)))) as proof of (forall (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))) % Found (fun (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((((x0 ((setadjoin A) ((setadjoin B) emptyset))) Xx) A) x1) ((x A) ((setadjoin B) emptyset)))) as proof of (forall (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))) % Found (fun (x0:setunionI) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((((x0 ((setadjoin A) ((setadjoin B) emptyset))) Xx) A) x1) ((x A) ((setadjoin B) emptyset)))) as proof of (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))) % Found (fun (x:setadjoinIL) (x0:setunionI) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((((x0 ((setadjoin A) ((setadjoin B) emptyset))) Xx) A) x1) ((x A) ((setadjoin B) emptyset)))) as proof of (setunionI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B))))) % Found (fun (x:setadjoinIL) (x0:setunionI) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((((x0 ((setadjoin A) ((setadjoin B) emptyset))) Xx) A) x1) ((x A) ((setadjoin B) emptyset)))) as proof of (setadjoinIL->(setunionI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))))) % Got proof (fun (x:setadjoinIL) (x0:setunionI) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((((x0 ((setadjoin A) ((setadjoin B) emptyset))) Xx) A) x1) ((x A) ((setadjoin B) emptyset)))) % Time elapsed = 0.102020s % node=17 cost=210.000000 depth=14 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:setadjoinIL) (x0:setunionI) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((((x0 ((setadjoin A) ((setadjoin B) emptyset))) Xx) A) x1) ((x A) ((setadjoin B) emptyset)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------