%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU574^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 : n102.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:30 EDT 2014 % Result : Theorem 1.12s % Output : Proof 1.12s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU574^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n102.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:46:41 CDT 2014 % % CPUTime : 1.12 % 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 0x1d30f38>, <kernel.DependentProduct object at 0x1d30fc8>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x20f0098>, <kernel.Sort object at 0x1bfb638>) of role type named setext_type % Using role type % Declaring setext:Prop % FOF formula (((eq Prop) setext) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->(((eq fofType) A) B))))) of role definition named setext % A new definition: (((eq Prop) setext) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->(((eq fofType) A) B))))) % Defined: setext:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->(((eq fofType) A) B)))) % FOF formula (<kernel.Constant object at 0x1d30c68>, <kernel.DependentProduct object at 0x1d303b0>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1d30440>, <kernel.Sort object at 0x1bfb638>) of role type named subsetE_type % Using role type % Declaring subsetE:Prop % FOF formula (((eq Prop) subsetE) (forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B))))) of role definition named subsetE % A new definition: (((eq Prop) subsetE) (forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B))))) % Defined: subsetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B)))) % FOF formula (setext->(subsetE->(forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B)))))) of role conjecture named setextsub % Conjecture to prove = (setext->(subsetE->(forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B)))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(setext->(subsetE->(forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Definition setext:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->(((eq fofType) A) B)))):Prop. % Parameter subset:(fofType->(fofType->Prop)). % Definition subsetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B)))):Prop. % Trying to prove (setext->(subsetE->(forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B)))))) % Found x00000:=(x0000 Xx):(((in Xx) A)->((in Xx) B)) % Found (x0000 Xx) as proof of (((in Xx) A)->((in Xx) B)) % Found ((fun (Xx0:fofType)=> ((x000 Xx0) x1)) Xx) as proof of (((in Xx) A)->((in Xx) B)) % Found ((fun (Xx0:fofType)=> (((x00 B) Xx0) x1)) Xx) as proof of (((in Xx) A)->((in Xx) B)) % Found ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx) as proof of (((in Xx) A)->((in Xx) B)) % Found (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx)) as proof of (((in Xx) A)->((in Xx) B)) % Found (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx)) as proof of (forall (Xx:fofType), (((in Xx) A)->((in Xx) B))) % Found x00000:=(x0000 Xx):(((in Xx) B)->((in Xx) A)) % Found (x0000 Xx) as proof of (((in Xx) B)->((in Xx) A)) % Found ((fun (Xx0:fofType)=> ((x000 Xx0) x2)) Xx) as proof of (((in Xx) B)->((in Xx) A)) % Found ((fun (Xx0:fofType)=> (((x00 A) Xx0) x2)) Xx) as proof of (((in Xx) B)->((in Xx) A)) % Found ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx) as proof of (((in Xx) B)->((in Xx) A)) % Found (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx)) as proof of (((in Xx) B)->((in Xx) A)) % Found (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx)) as proof of (forall (Xx:fofType), (((in Xx) B)->((in Xx) A))) % Found ((x30 (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx))) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx))) as proof of (((eq fofType) A) B) % Found (((x3 B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx))) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx))) as proof of (((eq fofType) A) B) % Found ((((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx))) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx))) as proof of (((eq fofType) A) B) % Found (fun (x2:((subset B) A))=> ((((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx))) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx)))) as proof of (((eq fofType) A) B) % Found (fun (x1:((subset A) B)) (x2:((subset B) A))=> ((((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx))) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx)))) as proof of (((subset B) A)->(((eq fofType) A) B)) % Found (fun (B:fofType) (x1:((subset A) B)) (x2:((subset B) A))=> ((((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx))) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx)))) as proof of (((subset A) B)->(((subset B) A)->(((eq fofType) A) B))) % Found (fun (A:fofType) (B:fofType) (x1:((subset A) B)) (x2:((subset B) A))=> ((((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx))) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx)))) as proof of (forall (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B)))) % Found (fun (x0:subsetE) (A:fofType) (B:fofType) (x1:((subset A) B)) (x2:((subset B) A))=> ((((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx))) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx)))) as proof of (forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B)))) % Found (fun (x:setext) (x0:subsetE) (A:fofType) (B:fofType) (x1:((subset A) B)) (x2:((subset B) A))=> ((((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx))) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx)))) as proof of (subsetE->(forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B))))) % Found (fun (x:setext) (x0:subsetE) (A:fofType) (B:fofType) (x1:((subset A) B)) (x2:((subset B) A))=> ((((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx))) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx)))) as proof of (setext->(subsetE->(forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B)))))) % Got proof (fun (x:setext) (x0:subsetE) (A:fofType) (B:fofType) (x1:((subset A) B)) (x2:((subset B) A))=> ((((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx))) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx)))) % Time elapsed = 0.792169s % node=159 cost=105.000000 depth=15 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:setext) (x0:subsetE) (A:fofType) (B:fofType) (x1:((subset A) B)) (x2:((subset B) A))=> ((((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 A) B) Xx0) x1)) Xx))) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x2)) Xx)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------