%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU810^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 : n108.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:33:12 EDT 2014 % Result : Theorem 0.59s % Output : Proof 0.59s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU810^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n108.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 11:32:11 CDT 2014 % % CPUTime : 0.59 % 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 0xd3f8c0>, <kernel.DependentProduct object at 0xd3fb90>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1117098>, <kernel.Single object at 0xd3fa28>) of role type named emptyset_type % Using role type % Declaring emptyset:fofType % FOF formula (<kernel.Constant object at 0xd3fb90>, <kernel.DependentProduct object at 0xd3fb00>) of role type named setadjoin_type % Using role type % Declaring setadjoin:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0xd3f710>, <kernel.Single object at 0xd3f680>) of role type named omega_type % Using role type % Declaring omega:fofType % FOF formula (<kernel.Constant object at 0xd3f638>, <kernel.Sort object at 0xc24d88>) of role type named emptysetE_type % Using role type % Declaring emptysetE:Prop % FOF formula (((eq Prop) emptysetE) (forall (Xx:fofType), (((in Xx) emptyset)->(forall (Xphi:Prop), Xphi)))) of role definition named emptysetE % A new definition: (((eq Prop) emptysetE) (forall (Xx:fofType), (((in Xx) emptyset)->(forall (Xphi:Prop), Xphi)))) % Defined: emptysetE:=(forall (Xx:fofType), (((in Xx) emptyset)->(forall (Xphi:Prop), Xphi))) % FOF formula (<kernel.Constant object at 0xd3fa28>, <kernel.Sort object at 0xc24d88>) 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 0xd3f4d0>, <kernel.Sort object at 0xc24d88>) of role type named in__Cong_type % Using role type % Declaring in__Cong:Prop % FOF formula (((eq Prop) in__Cong) (forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B))))))) of role definition named in__Cong % A new definition: (((eq Prop) in__Cong) (forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B))))))) % Defined: in__Cong:=(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B)))))) % FOF formula (<kernel.Constant object at 0xd3fb48>, <kernel.DependentProduct object at 0xd3fcb0>) of role type named omegaS_type % Using role type % Declaring omegaS:(fofType->fofType) % FOF formula (((eq (fofType->fofType)) omegaS) (fun (Xx:fofType)=> ((setadjoin Xx) Xx))) of role definition named omegaS % A new definition: (((eq (fofType->fofType)) omegaS) (fun (Xx:fofType)=> ((setadjoin Xx) Xx))) % Defined: omegaS:=(fun (Xx:fofType)=> ((setadjoin Xx) Xx)) % FOF formula (emptysetE->(setadjoinIL->(in__Cong->(forall (Xx:fofType), (((in Xx) omega)->(not (((eq fofType) (omegaS Xx)) emptyset))))))) of role conjecture named peano0notS % Conjecture to prove = (emptysetE->(setadjoinIL->(in__Cong->(forall (Xx:fofType), (((in Xx) omega)->(not (((eq fofType) (omegaS Xx)) emptyset))))))):Prop % We need to prove ['(emptysetE->(setadjoinIL->(in__Cong->(forall (Xx:fofType), (((in Xx) omega)->(not (((eq fofType) (omegaS Xx)) emptyset)))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter emptyset:fofType. % Parameter setadjoin:(fofType->(fofType->fofType)). % Parameter omega:fofType. % Definition emptysetE:=(forall (Xx:fofType), (((in Xx) emptyset)->(forall (Xphi:Prop), Xphi))):Prop. % Definition setadjoinIL:=(forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) Xy))):Prop. % Definition in__Cong:=(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B)))))):Prop. % Definition omegaS:=(fun (Xx:fofType)=> ((setadjoin Xx) Xx)):(fofType->fofType). % Trying to prove (emptysetE->(setadjoinIL->(in__Cong->(forall (Xx:fofType), (((in Xx) omega)->(not (((eq fofType) (omegaS Xx)) emptyset))))))) % Found x000:=(x00 Xx):((in Xx0) ((setadjoin Xx0) Xx)) % Found (x00 Xx) as proof of ((in Xx0) (omegaS Xx)) % Found ((x0 Xx0) Xx) as proof of ((in Xx0) (omegaS Xx)) % Found ((x0 Xx0) Xx) as proof of ((in Xx0) (omegaS Xx)) % Found ((x0 Xx0) Xx) as proof of ((in Xx0) (omegaS Xx)) % Found (x30 ((x0 Xx0) Xx)) as proof of ((in Xx0) emptyset) % Found ((x3 (in Xx0)) ((x0 Xx0) Xx)) as proof of ((in Xx0) emptyset) % Found ((x3 (in Xx0)) ((x0 Xx0) Xx)) as proof of ((in Xx0) emptyset) % Found (x40 ((x3 (in Xx0)) ((x0 Xx0) Xx))) as proof of False % Found (x40 ((x3 (in Xx0)) ((x0 Xx0) Xx))) as proof of False % Found ((fun (x5:((in Xx0) emptyset))=> ((x4 x5) False)) ((x3 (in Xx0)) ((x0 Xx0) Xx))) as proof of False % Found ((fun (x5:((in Xx) emptyset))=> (((x Xx) x5) False)) ((x3 (in Xx)) ((x0 Xx) Xx))) as proof of False % Found (fun (x3:(((eq fofType) (omegaS Xx)) emptyset))=> ((fun (x5:((in Xx) emptyset))=> (((x Xx) x5) False)) ((x3 (in Xx)) ((x0 Xx) Xx)))) as proof of False % Found (fun (x2:((in Xx) omega)) (x3:(((eq fofType) (omegaS Xx)) emptyset))=> ((fun (x5:((in Xx) emptyset))=> (((x Xx) x5) False)) ((x3 (in Xx)) ((x0 Xx) Xx)))) as proof of (not (((eq fofType) (omegaS Xx)) emptyset)) % Found (fun (Xx:fofType) (x2:((in Xx) omega)) (x3:(((eq fofType) (omegaS Xx)) emptyset))=> ((fun (x5:((in Xx) emptyset))=> (((x Xx) x5) False)) ((x3 (in Xx)) ((x0 Xx) Xx)))) as proof of (((in Xx) omega)->(not (((eq fofType) (omegaS Xx)) emptyset))) % Found (fun (x1:in__Cong) (Xx:fofType) (x2:((in Xx) omega)) (x3:(((eq fofType) (omegaS Xx)) emptyset))=> ((fun (x5:((in Xx) emptyset))=> (((x Xx) x5) False)) ((x3 (in Xx)) ((x0 Xx) Xx)))) as proof of (forall (Xx:fofType), (((in Xx) omega)->(not (((eq fofType) (omegaS Xx)) emptyset)))) % Found (fun (x0:setadjoinIL) (x1:in__Cong) (Xx:fofType) (x2:((in Xx) omega)) (x3:(((eq fofType) (omegaS Xx)) emptyset))=> ((fun (x5:((in Xx) emptyset))=> (((x Xx) x5) False)) ((x3 (in Xx)) ((x0 Xx) Xx)))) as proof of (in__Cong->(forall (Xx:fofType), (((in Xx) omega)->(not (((eq fofType) (omegaS Xx)) emptyset))))) % Found (fun (x:emptysetE) (x0:setadjoinIL) (x1:in__Cong) (Xx:fofType) (x2:((in Xx) omega)) (x3:(((eq fofType) (omegaS Xx)) emptyset))=> ((fun (x5:((in Xx) emptyset))=> (((x Xx) x5) False)) ((x3 (in Xx)) ((x0 Xx) Xx)))) as proof of (setadjoinIL->(in__Cong->(forall (Xx:fofType), (((in Xx) omega)->(not (((eq fofType) (omegaS Xx)) emptyset)))))) % Found (fun (x:emptysetE) (x0:setadjoinIL) (x1:in__Cong) (Xx:fofType) (x2:((in Xx) omega)) (x3:(((eq fofType) (omegaS Xx)) emptyset))=> ((fun (x5:((in Xx) emptyset))=> (((x Xx) x5) False)) ((x3 (in Xx)) ((x0 Xx) Xx)))) as proof of (emptysetE->(setadjoinIL->(in__Cong->(forall (Xx:fofType), (((in Xx) omega)->(not (((eq fofType) (omegaS Xx)) emptyset))))))) % Got proof (fun (x:emptysetE) (x0:setadjoinIL) (x1:in__Cong) (Xx:fofType) (x2:((in Xx) omega)) (x3:(((eq fofType) (omegaS Xx)) emptyset))=> ((fun (x5:((in Xx) emptyset))=> (((x Xx) x5) False)) ((x3 (in Xx)) ((x0 Xx) Xx)))) % Time elapsed = 0.268135s % node=42 cost=701.000000 depth=17 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:emptysetE) (x0:setadjoinIL) (x1:in__Cong) (Xx:fofType) (x2:((in Xx) omega)) (x3:(((eq fofType) (omegaS Xx)) emptyset))=> ((fun (x5:((in Xx) emptyset))=> (((x Xx) x5) False)) ((x3 (in Xx)) ((x0 Xx) Xx)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------