%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU822^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 : n096.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:14 EDT 2014 % Result : Theorem 2.19s % Output : Proof 2.19s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU822^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n096.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:34:21 CDT 2014 % % CPUTime : 2.19 % 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 0x1c9a6c8>, <kernel.DependentProduct object at 0x1c9ac20>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1e78050>, <kernel.DependentProduct object at 0x1c9a8c0>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x1c9a5f0>, <kernel.DependentProduct object at 0x1c9ac20>) of role type named nonempty_type % Using role type % Declaring nonempty:(fofType->Prop) % FOF formula (<kernel.Constant object at 0x1c9af38>, <kernel.DependentProduct object at 0x1c9a518>) of role type named transitiveset_type % Using role type % Declaring transitiveset:(fofType->Prop) % FOF formula (<kernel.Constant object at 0x1c9afc8>, <kernel.DependentProduct object at 0x1c9a7e8>) of role type named stricttotalorderedByIn_type % Using role type % Declaring stricttotalorderedByIn:(fofType->Prop) % FOF formula (((eq (fofType->Prop)) stricttotalorderedByIn) (fun (A:fofType)=> ((and ((and (forall (Xx:fofType), (((in Xx) A)->(forall (X:fofType), (((in X) A)->(forall (Y:fofType), (((in Y) A)->(((and ((in Xx) X)) ((in X) Y))->((in Xx) Y))))))))) (forall (X:fofType), (((in X) A)->(forall (Y:fofType), (((in Y) A)->((or ((or (((eq fofType) X) Y)) ((in X) Y))) ((in Y) X)))))))) (forall (X:fofType), (((in X) A)->(((in X) X)->False)))))) of role definition named stricttotalorderedByIn % A new definition: (((eq (fofType->Prop)) stricttotalorderedByIn) (fun (A:fofType)=> ((and ((and (forall (Xx:fofType), (((in Xx) A)->(forall (X:fofType), (((in X) A)->(forall (Y:fofType), (((in Y) A)->(((and ((in Xx) X)) ((in X) Y))->((in Xx) Y))))))))) (forall (X:fofType), (((in X) A)->(forall (Y:fofType), (((in Y) A)->((or ((or (((eq fofType) X) Y)) ((in X) Y))) ((in Y) X)))))))) (forall (X:fofType), (((in X) A)->(((in X) X)->False)))))) % Defined: stricttotalorderedByIn:=(fun (A:fofType)=> ((and ((and (forall (Xx:fofType), (((in Xx) A)->(forall (X:fofType), (((in X) A)->(forall (Y:fofType), (((in Y) A)->(((and ((in Xx) X)) ((in X) Y))->((in Xx) Y))))))))) (forall (X:fofType), (((in X) A)->(forall (Y:fofType), (((in Y) A)->((or ((or (((eq fofType) X) Y)) ((in X) Y))) ((in Y) X)))))))) (forall (X:fofType), (((in X) A)->(((in X) X)->False))))) % FOF formula (<kernel.Constant object at 0x1c9a7e8>, <kernel.DependentProduct object at 0x1c9af38>) of role type named wellorderedByIn_type % Using role type % Declaring wellorderedByIn:(fofType->Prop) % FOF formula (((eq (fofType->Prop)) wellorderedByIn) (fun (A:fofType)=> ((and (stricttotalorderedByIn A)) (forall (X:fofType), (((in X) (powerset A))->((nonempty X)->((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) X)) (forall (Y:fofType), (((in Y) X)->((or (((eq fofType) Xx) Y)) ((in Xx) Y))))))))))))) of role definition named wellorderedByIn % A new definition: (((eq (fofType->Prop)) wellorderedByIn) (fun (A:fofType)=> ((and (stricttotalorderedByIn A)) (forall (X:fofType), (((in X) (powerset A))->((nonempty X)->((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) X)) (forall (Y:fofType), (((in Y) X)->((or (((eq fofType) Xx) Y)) ((in Xx) Y))))))))))))) % Defined: wellorderedByIn:=(fun (A:fofType)=> ((and (stricttotalorderedByIn A)) (forall (X:fofType), (((in X) (powerset A))->((nonempty X)->((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) X)) (forall (Y:fofType), (((in Y) X)->((or (((eq fofType) Xx) Y)) ((in Xx) Y)))))))))))) % FOF formula (<kernel.Constant object at 0x1c9af38>, <kernel.DependentProduct object at 0x1c9ac20>) of role type named ordinal_type % Using role type % Declaring ordinal:(fofType->Prop) % FOF formula (((eq (fofType->Prop)) ordinal) (fun (Xx:fofType)=> ((and (transitiveset Xx)) (wellorderedByIn Xx)))) of role definition named ordinal % A new definition: (((eq (fofType->Prop)) ordinal) (fun (Xx:fofType)=> ((and (transitiveset Xx)) (wellorderedByIn Xx)))) % Defined: ordinal:=(fun (Xx:fofType)=> ((and (transitiveset Xx)) (wellorderedByIn Xx))) % FOF formula (<kernel.Constant object at 0x1c9ac20>, <kernel.Sort object at 0x1f48878>) of role type named ordinalIrrefl_type % Using role type % Declaring ordinalIrrefl:Prop % FOF formula (((eq Prop) ordinalIrrefl) (forall (X:fofType), ((ordinal X)->(forall (A:fofType), (((in A) X)->(((in A) A)->False)))))) of role definition named ordinalIrrefl % A new definition: (((eq Prop) ordinalIrrefl) (forall (X:fofType), ((ordinal X)->(forall (A:fofType), (((in A) X)->(((in A) A)->False)))))) % Defined: ordinalIrrefl:=(forall (X:fofType), ((ordinal X)->(forall (A:fofType), (((in A) X)->(((in A) A)->False))))) % FOF formula (ordinalIrrefl->(forall (X:fofType), ((ordinal X)->(((in X) X)->False)))) of role conjecture named ordinalIrrefl2 % Conjecture to prove = (ordinalIrrefl->(forall (X:fofType), ((ordinal X)->(((in X) X)->False)))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(ordinalIrrefl->(forall (X:fofType), ((ordinal X)->(((in X) X)->False))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter powerset:(fofType->fofType). % Parameter nonempty:(fofType->Prop). % Parameter transitiveset:(fofType->Prop). % Definition stricttotalorderedByIn:=(fun (A:fofType)=> ((and ((and (forall (Xx:fofType), (((in Xx) A)->(forall (X:fofType), (((in X) A)->(forall (Y:fofType), (((in Y) A)->(((and ((in Xx) X)) ((in X) Y))->((in Xx) Y))))))))) (forall (X:fofType), (((in X) A)->(forall (Y:fofType), (((in Y) A)->((or ((or (((eq fofType) X) Y)) ((in X) Y))) ((in Y) X)))))))) (forall (X:fofType), (((in X) A)->(((in X) X)->False))))):(fofType->Prop). % Definition wellorderedByIn:=(fun (A:fofType)=> ((and (stricttotalorderedByIn A)) (forall (X:fofType), (((in X) (powerset A))->((nonempty X)->((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) X)) (forall (Y:fofType), (((in Y) X)->((or (((eq fofType) Xx) Y)) ((in Xx) Y)))))))))))):(fofType->Prop). % Definition ordinal:=(fun (Xx:fofType)=> ((and (transitiveset Xx)) (wellorderedByIn Xx))):(fofType->Prop). % Definition ordinalIrrefl:=(forall (X:fofType), ((ordinal X)->(forall (A:fofType), (((in A) X)->(((in A) A)->False))))):Prop. % Trying to prove (ordinalIrrefl->(forall (X:fofType), ((ordinal X)->(((in X) X)->False)))) % Found x0:(ordinal X) % Found x0 as proof of (ordinal X) % Found x0:(ordinal X) % Found x0 as proof of (ordinal X) % Found x1:((in X) X) % Found x1 as proof of ((in X) X) % Found (x2000 x1) as proof of False % Found ((x200 x0) x1) as proof of False % Found (((x20 X) x0) x1) as proof of False % Found ((((fun (X0:fofType) (x20:(ordinal X0)) (x3:((in X) X0))=> ((((x2 X0) x20) x3) x1)) X) x0) x1) as proof of False % Found ((((fun (X0:fofType) (x20:(ordinal X0)) (x3:((in X) X0))=> (((((fun (X0:fofType) (x2:(ordinal X0))=> (((x X0) x2) X)) X0) x20) x3) x1)) X) x0) x1) as proof of False % Found (fun (x1:((in X) X))=> ((((fun (X0:fofType) (x20:(ordinal X0)) (x3:((in X) X0))=> (((((fun (X0:fofType) (x2:(ordinal X0))=> (((x X0) x2) X)) X0) x20) x3) x1)) X) x0) x1)) as proof of False % Found (fun (x0:(ordinal X)) (x1:((in X) X))=> ((((fun (X0:fofType) (x20:(ordinal X0)) (x3:((in X) X0))=> (((((fun (X0:fofType) (x2:(ordinal X0))=> (((x X0) x2) X)) X0) x20) x3) x1)) X) x0) x1)) as proof of (((in X) X)->False) % Found (fun (X:fofType) (x0:(ordinal X)) (x1:((in X) X))=> ((((fun (X0:fofType) (x20:(ordinal X0)) (x3:((in X) X0))=> (((((fun (X0:fofType) (x2:(ordinal X0))=> (((x X0) x2) X)) X0) x20) x3) x1)) X) x0) x1)) as proof of ((ordinal X)->(((in X) X)->False)) % Found (fun (x:ordinalIrrefl) (X:fofType) (x0:(ordinal X)) (x1:((in X) X))=> ((((fun (X0:fofType) (x20:(ordinal X0)) (x3:((in X) X0))=> (((((fun (X0:fofType) (x2:(ordinal X0))=> (((x X0) x2) X)) X0) x20) x3) x1)) X) x0) x1)) as proof of (forall (X:fofType), ((ordinal X)->(((in X) X)->False))) % Found (fun (x:ordinalIrrefl) (X:fofType) (x0:(ordinal X)) (x1:((in X) X))=> ((((fun (X0:fofType) (x20:(ordinal X0)) (x3:((in X) X0))=> (((((fun (X0:fofType) (x2:(ordinal X0))=> (((x X0) x2) X)) X0) x20) x3) x1)) X) x0) x1)) as proof of (ordinalIrrefl->(forall (X:fofType), ((ordinal X)->(((in X) X)->False)))) % Got proof (fun (x:ordinalIrrefl) (X:fofType) (x0:(ordinal X)) (x1:((in X) X))=> ((((fun (X0:fofType) (x20:(ordinal X0)) (x3:((in X) X0))=> (((((fun (X0:fofType) (x2:(ordinal X0))=> (((x X0) x2) X)) X0) x20) x3) x1)) X) x0) x1)) % Time elapsed = 1.844637s % node=200 cost=500.000000 depth=10 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:ordinalIrrefl) (X:fofType) (x0:(ordinal X)) (x1:((in X) X))=> ((((fun (X0:fofType) (x20:(ordinal X0)) (x3:((in X) X0))=> (((((fun (X0:fofType) (x2:(ordinal X0))=> (((x X0) x2) X)) X0) x20) x3) x1)) X) x0) x1)) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------