%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU529^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:23 EDT 2014 % Result : Theorem 0.47s % Output : Proof 0.47s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU529^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:31:51 CDT 2014 % % CPUTime : 0.47 % 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 0x20814d0>, <kernel.DependentProduct object at 0x2081098>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1b8a950>, <kernel.Single object at 0x20812d8>) of role type named emptyset_type % Using role type % Declaring emptyset:fofType % FOF formula (<kernel.Constant object at 0x2081098>, <kernel.DependentProduct object at 0x20818c0>) of role type named setadjoin_type % Using role type % Declaring setadjoin:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x2081440>, <kernel.Sort object at 0x1b8c998>) 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), ((((eq fofType) Xx) Xy)->((in Xx) ((setadjoin Xy) emptyset))))) of role conjecture named eqinunit % Conjecture to prove = (setadjoinIL->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((in Xx) ((setadjoin Xy) emptyset))))):Prop % We need to prove ['(setadjoinIL->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((in 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), ((((eq fofType) Xx) Xy)->((in Xx) ((setadjoin Xy) emptyset))))) % Found x10:=(x1 emptyset):((in Xx) ((setadjoin Xx) emptyset)) % Found (x1 emptyset) as proof of ((in Xx) ((setadjoin Xx) emptyset)) % Found ((x Xx) emptyset) as proof of ((in Xx) ((setadjoin Xx) emptyset)) % Found ((x Xx) emptyset) as proof of ((in Xx) ((setadjoin Xx) emptyset)) % Found (x00 ((x Xx) emptyset)) as proof of ((in Xx) ((setadjoin Xy) emptyset)) % Found ((x0 (fun (x2:fofType)=> ((in Xx) ((setadjoin x2) emptyset)))) ((x Xx) emptyset)) as proof of ((in Xx) ((setadjoin Xy) emptyset)) % Found (fun (x0:(((eq fofType) Xx) Xy))=> ((x0 (fun (x2:fofType)=> ((in Xx) ((setadjoin x2) emptyset)))) ((x Xx) emptyset))) as proof of ((in Xx) ((setadjoin Xy) emptyset)) % Found (fun (Xy:fofType) (x0:(((eq fofType) Xx) Xy))=> ((x0 (fun (x2:fofType)=> ((in Xx) ((setadjoin x2) emptyset)))) ((x Xx) emptyset))) as proof of ((((eq fofType) Xx) Xy)->((in Xx) ((setadjoin Xy) emptyset))) % Found (fun (Xx:fofType) (Xy:fofType) (x0:(((eq fofType) Xx) Xy))=> ((x0 (fun (x2:fofType)=> ((in Xx) ((setadjoin x2) emptyset)))) ((x Xx) emptyset))) as proof of (forall (Xy:fofType), ((((eq fofType) Xx) Xy)->((in Xx) ((setadjoin Xy) emptyset)))) % Found (fun (x:setadjoinIL) (Xx:fofType) (Xy:fofType) (x0:(((eq fofType) Xx) Xy))=> ((x0 (fun (x2:fofType)=> ((in Xx) ((setadjoin x2) emptyset)))) ((x Xx) emptyset))) as proof of (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((in Xx) ((setadjoin Xy) emptyset)))) % Found (fun (x:setadjoinIL) (Xx:fofType) (Xy:fofType) (x0:(((eq fofType) Xx) Xy))=> ((x0 (fun (x2:fofType)=> ((in Xx) ((setadjoin x2) emptyset)))) ((x Xx) emptyset))) as proof of (setadjoinIL->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((in Xx) ((setadjoin Xy) emptyset))))) % Got proof (fun (x:setadjoinIL) (Xx:fofType) (Xy:fofType) (x0:(((eq fofType) Xx) Xy))=> ((x0 (fun (x2:fofType)=> ((in Xx) ((setadjoin x2) emptyset)))) ((x Xx) emptyset))) % Time elapsed = 0.149244s % node=17 cost=-124.000000 depth=9 % :::::::::::::::::::::: % % 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) (x0:(((eq fofType) Xx) Xy))=> ((x0 (fun (x2:fofType)=> ((in Xx) ((setadjoin x2) emptyset)))) ((x Xx) emptyset))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------