%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU532^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 : n114.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:23 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 : SEU532^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n114.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:32: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 0x8c86c8>, <kernel.DependentProduct object at 0x8c8c20>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0xca03f8>, <kernel.Single object at 0x8c8f38>) of role type named emptyset_type % Using role type % Declaring emptyset:fofType % FOF formula (<kernel.Constant object at 0x8c8c20>, <kernel.DependentProduct object at 0x8c8ab8>) of role type named setadjoin_type % Using role type % Declaring setadjoin:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x8c85a8>, <kernel.Sort object at 0x7ad638>) 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 (setadjoinIL->(forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) ((setadjoin Xy) emptyset))))) of role conjecture named upairsetIL % Conjecture to prove = (setadjoinIL->(forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) ((setadjoin Xy) emptyset))))):Prop % We need to prove ['(setadjoinIL->(forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) ((setadjoin Xy) emptyset)))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter emptyset:fofType. % Parameter setadjoin:(fofType->(fofType->fofType)). % Definition setadjoinIL:=(forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) Xy))):Prop. % Trying to prove (setadjoinIL->(forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) ((setadjoin Xy) emptyset))))) % Found x00:=(x0 ((setadjoin Xy) emptyset)):((in Xx) ((setadjoin Xx) ((setadjoin Xy) emptyset))) % Found (x0 ((setadjoin Xy) emptyset)) as proof of ((in Xx) ((setadjoin Xx) ((setadjoin Xy) emptyset))) % Found ((x Xx) ((setadjoin Xy) emptyset)) as proof of ((in Xx) ((setadjoin Xx) ((setadjoin Xy) emptyset))) % Found (fun (Xy:fofType)=> ((x Xx) ((setadjoin Xy) emptyset))) as proof of ((in Xx) ((setadjoin Xx) ((setadjoin Xy) emptyset))) % Found (fun (Xx:fofType) (Xy:fofType)=> ((x Xx) ((setadjoin Xy) emptyset))) as proof of (forall (Xy:fofType), ((in Xx) ((setadjoin Xx) ((setadjoin Xy) emptyset)))) % Found (fun (x:setadjoinIL) (Xx:fofType) (Xy:fofType)=> ((x Xx) ((setadjoin Xy) emptyset))) as proof of (forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) ((setadjoin Xy) emptyset)))) % Found (fun (x:setadjoinIL) (Xx:fofType) (Xy:fofType)=> ((x Xx) ((setadjoin Xy) emptyset))) as proof of (setadjoinIL->(forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) ((setadjoin Xy) emptyset))))) % Got proof (fun (x:setadjoinIL) (Xx:fofType) (Xy:fofType)=> ((x Xx) ((setadjoin Xy) emptyset))) % Time elapsed = 0.038303s % node=5 cost=-180.000000 depth=5 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:setadjoinIL) (Xx:fofType) (Xy:fofType)=> ((x Xx) ((setadjoin Xy) emptyset))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------