%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU782^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 : n184.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:06 EDT 2014 % Result : Theorem 1.40s % Output : Proof 1.40s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU782^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n184.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:27:26 CDT 2014 % % CPUTime : 1.40 % 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 0x29422d8>, <kernel.DependentProduct object at 0x2942cb0>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x29426c8>, <kernel.DependentProduct object at 0x2942cb0>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x29425f0>, <kernel.Sort object at 0x261ab48>) of role type named subsetI1_type % Using role type % Declaring subsetI1:Prop % FOF formula (((eq Prop) subsetI1) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) of role definition named subsetI1 % A new definition: (((eq Prop) subsetI1) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) % Defined: subsetI1:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))) % FOF formula (<kernel.Constant object at 0x29421b8>, <kernel.Sort object at 0x261ab48>) 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 (<kernel.Constant object at 0x2b8c320>, <kernel.DependentProduct object at 0x29425f0>) of role type named binunion_type % Using role type % Declaring binunion:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x2b8c200>, <kernel.Sort object at 0x261ab48>) of role type named binunionEcases_type % Using role type % Declaring binunionEcases:Prop % FOF formula (((eq Prop) binunionEcases) (forall (A:fofType) (B:fofType) (Xx:fofType) (Xphi:Prop), (((in Xx) ((binunion A) B))->((((in Xx) A)->Xphi)->((((in Xx) B)->Xphi)->Xphi))))) of role definition named binunionEcases % A new definition: (((eq Prop) binunionEcases) (forall (A:fofType) (B:fofType) (Xx:fofType) (Xphi:Prop), (((in Xx) ((binunion A) B))->((((in Xx) A)->Xphi)->((((in Xx) B)->Xphi)->Xphi))))) % Defined: binunionEcases:=(forall (A:fofType) (B:fofType) (Xx:fofType) (Xphi:Prop), (((in Xx) ((binunion A) B))->((((in Xx) A)->Xphi)->((((in Xx) B)->Xphi)->Xphi)))) % FOF formula (<kernel.Constant object at 0x2b8c200>, <kernel.DependentProduct object at 0x29422d8>) of role type named cartprod_type % Using role type % Declaring cartprod:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x2b8cc68>, <kernel.DependentProduct object at 0x29426c8>) of role type named breln_type % Using role type % Declaring breln:(fofType->(fofType->(fofType->Prop))) % FOF formula (((eq (fofType->(fofType->(fofType->Prop)))) breln) (fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B)))) of role definition named breln % A new definition: (((eq (fofType->(fofType->(fofType->Prop)))) breln) (fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B)))) % Defined: breln:=(fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B))) % FOF formula (<kernel.Constant object at 0x2b8c200>, <kernel.DependentProduct object at 0x29425f0>) of role type named breln1_type % Using role type % Declaring breln1:(fofType->(fofType->Prop)) % FOF formula (((eq (fofType->(fofType->Prop))) breln1) (fun (A:fofType) (R:fofType)=> (((breln A) A) R))) of role definition named breln1 % A new definition: (((eq (fofType->(fofType->Prop))) breln1) (fun (A:fofType) (R:fofType)=> (((breln A) A) R))) % Defined: breln1:=(fun (A:fofType) (R:fofType)=> (((breln A) A) R)) % FOF formula (subsetI1->(subsetE->(binunionEcases->(forall (A:fofType) (R:fofType), (((breln1 A) R)->(forall (S:fofType), (((breln1 A) S)->((breln1 A) ((binunion R) S))))))))) of role conjecture named breln1unionprop % Conjecture to prove = (subsetI1->(subsetE->(binunionEcases->(forall (A:fofType) (R:fofType), (((breln1 A) R)->(forall (S:fofType), (((breln1 A) S)->((breln1 A) ((binunion R) S))))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(subsetI1->(subsetE->(binunionEcases->(forall (A:fofType) (R:fofType), (((breln1 A) R)->(forall (S:fofType), (((breln1 A) S)->((breln1 A) ((binunion R) S)))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter subset:(fofType->(fofType->Prop)). % Definition subsetI1:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))):Prop. % Definition subsetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B)))):Prop. % Parameter binunion:(fofType->(fofType->fofType)). % Definition binunionEcases:=(forall (A:fofType) (B:fofType) (Xx:fofType) (Xphi:Prop), (((in Xx) ((binunion A) B))->((((in Xx) A)->Xphi)->((((in Xx) B)->Xphi)->Xphi)))):Prop. % Parameter cartprod:(fofType->(fofType->fofType)). % Definition breln:=(fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B))):(fofType->(fofType->(fofType->Prop))). % Definition breln1:=(fun (A:fofType) (R:fofType)=> (((breln A) A) R)):(fofType->(fofType->Prop)). % Trying to prove (subsetI1->(subsetE->(binunionEcases->(forall (A:fofType) (R:fofType), (((breln1 A) R)->(forall (S:fofType), (((breln1 A) S)->((breln1 A) ((binunion R) S))))))))) % Found x5:((in Xx) ((binunion R) S)) % Instantiate: A0:=R:fofType;B:=S:fofType;Xx0:=Xx:fofType % Found x5 as proof of ((in Xx0) ((binunion A0) B)) % Found x6:((in Xx0) A0) % Instantiate: A0:=((cartprod A) A):fofType;Xx0:=Xx:fofType % Found (fun (x6:((in Xx0) A0))=> x6) as proof of ((in Xx) ((cartprod A) A)) % Found (fun (x6:((in Xx0) A0))=> x6) as proof of (((in Xx0) A0)->((in Xx) ((cartprod A) A))) % Found x6:((in Xx0) B) % Instantiate: B:=((cartprod A) A):fofType;Xx0:=Xx:fofType % Found (fun (x6:((in Xx0) B))=> x6) as proof of ((in Xx) ((cartprod A) A)) % Found (fun (x6:((in Xx0) B))=> x6) as proof of (((in Xx0) B)->((in Xx) ((cartprod A) A))) % Found x5:((in Xx) ((binunion R) S)) % Instantiate: A0:=R:fofType;B:=S:fofType;Xx0:=Xx:fofType % Found x5 as proof of ((in Xx0) ((binunion A0) B)) % Found x6:((in Xx0) B) % Instantiate: B:=((cartprod A) A):fofType;Xx0:=Xx:fofType % Found (fun (x6:((in Xx0) B))=> x6) as proof of ((in Xx) ((cartprod A) A)) % Found (fun (x6:((in Xx0) B))=> x6) as proof of (((in Xx0) B)->((in Xx) ((cartprod A) A))) % Found x6:((in Xx0) A0) % Instantiate: A0:=((cartprod A) A):fofType;Xx0:=Xx:fofType % Found (fun (x6:((in Xx0) A0))=> x6) as proof of ((in Xx) ((cartprod A) A)) % Found (fun (x6:((in Xx0) A0))=> x6) as proof of (((in Xx0) A0)->((in Xx) ((cartprod A) A))) % Found x00000:=(x0000 Xx0):(((in Xx0) A0)->((in Xx0) ((cartprod A) A))) % Found (x0000 Xx0) as proof of (((in Xx0) A0)->((in Xx) ((cartprod A) A))) % Found ((fun (Xx1:fofType)=> ((x000 Xx1) x2)) Xx0) as proof of (((in Xx0) A0)->((in Xx) ((cartprod A) A))) % Found ((fun (Xx1:fofType)=> (((x00 ((cartprod A) A)) Xx1) x2)) Xx0) as proof of (((in Xx0) A0)->((in Xx) ((cartprod A) A))) % Found ((fun (Xx1:fofType)=> ((((x0 A0) ((cartprod A) A)) Xx1) x2)) Xx0) as proof of (((in Xx0) A0)->((in Xx) ((cartprod A) A))) % Found ((fun (Xx1:fofType)=> ((((x0 A0) ((cartprod A) A)) Xx1) x2)) Xx0) as proof of (((in Xx0) A0)->((in Xx) ((cartprod A) A))) % Found x00000:=(x0000 Xx0):(((in Xx0) B)->((in Xx0) ((cartprod A) A))) % Found (x0000 Xx0) as proof of (((in Xx0) B)->((in Xx) ((cartprod A) A))) % Found ((fun (Xx1:fofType)=> ((x000 Xx1) x3)) Xx0) as proof of (((in Xx0) B)->((in Xx) ((cartprod A) A))) % Found ((fun (Xx1:fofType)=> (((x00 ((cartprod A) A)) Xx1) x3)) Xx0) as proof of (((in Xx0) B)->((in Xx) ((cartprod A) A))) % Found ((fun (Xx1:fofType)=> ((((x0 B) ((cartprod A) A)) Xx1) x3)) Xx0) as proof of (((in Xx0) B)->((in Xx) ((cartprod A) A))) % Found ((fun (Xx1:fofType)=> ((((x0 B) ((cartprod A) A)) Xx1) x3)) Xx0) as proof of (((in Xx0) B)->((in Xx) ((cartprod A) A))) % Found (((x10000 x5) ((fun (Xx1:fofType)=> ((((x0 A0) ((cartprod A) A)) Xx1) x2)) Xx0)) ((fun (Xx1:fofType)=> ((((x0 B) ((cartprod A) A)) Xx1) x3)) Xx0)) as proof of ((in Xx) ((cartprod A) A)) % Found ((((x1000 ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 A0) ((cartprod A) A)) Xx1) x2)) Xx0)) ((fun (Xx1:fofType)=> ((((x0 B) ((cartprod A) A)) Xx1) x3)) Xx0)) as proof of ((in Xx) ((cartprod A) A)) % Found (((((x100 Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 A0) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 B) ((cartprod A) A)) Xx1) x3)) Xx)) as proof of ((in Xx) ((cartprod A) A)) % Found ((((((x10 S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 A0) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx)) as proof of ((in Xx) ((cartprod A) A)) % Found (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx)) as proof of ((in Xx) ((cartprod A) A)) % Found (fun (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx))) as proof of ((in Xx) ((cartprod A) A)) % Found (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx))) as proof of (((in Xx) ((binunion R) S))->((in Xx) ((cartprod A) A))) % Found (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx))) as proof of (forall (Xx:fofType), (((in Xx) ((binunion R) S))->((in Xx) ((cartprod A) A)))) % Found (x40 (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx)))) as proof of ((breln1 A) ((binunion R) S)) % Found ((x4 ((cartprod A) A)) (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx)))) as proof of ((breln1 A) ((binunion R) S)) % Found (((x ((binunion R) S)) ((cartprod A) A)) (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx)))) as proof of ((breln1 A) ((binunion R) S)) % Found (fun (x3:((breln1 A) S))=> (((x ((binunion R) S)) ((cartprod A) A)) (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx))))) as proof of ((breln1 A) ((binunion R) S)) % Found (fun (S:fofType) (x3:((breln1 A) S))=> (((x ((binunion R) S)) ((cartprod A) A)) (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx))))) as proof of (((breln1 A) S)->((breln1 A) ((binunion R) S))) % Found (fun (x2:((breln1 A) R)) (S:fofType) (x3:((breln1 A) S))=> (((x ((binunion R) S)) ((cartprod A) A)) (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx))))) as proof of (forall (S:fofType), (((breln1 A) S)->((breln1 A) ((binunion R) S)))) % Found (fun (R:fofType) (x2:((breln1 A) R)) (S:fofType) (x3:((breln1 A) S))=> (((x ((binunion R) S)) ((cartprod A) A)) (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx))))) as proof of (((breln1 A) R)->(forall (S:fofType), (((breln1 A) S)->((breln1 A) ((binunion R) S))))) % Found (fun (A:fofType) (R:fofType) (x2:((breln1 A) R)) (S:fofType) (x3:((breln1 A) S))=> (((x ((binunion R) S)) ((cartprod A) A)) (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx))))) as proof of (forall (R:fofType), (((breln1 A) R)->(forall (S:fofType), (((breln1 A) S)->((breln1 A) ((binunion R) S)))))) % Found (fun (x1:binunionEcases) (A:fofType) (R:fofType) (x2:((breln1 A) R)) (S:fofType) (x3:((breln1 A) S))=> (((x ((binunion R) S)) ((cartprod A) A)) (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx))))) as proof of (forall (A:fofType) (R:fofType), (((breln1 A) R)->(forall (S:fofType), (((breln1 A) S)->((breln1 A) ((binunion R) S)))))) % Found (fun (x0:subsetE) (x1:binunionEcases) (A:fofType) (R:fofType) (x2:((breln1 A) R)) (S:fofType) (x3:((breln1 A) S))=> (((x ((binunion R) S)) ((cartprod A) A)) (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx))))) as proof of (binunionEcases->(forall (A:fofType) (R:fofType), (((breln1 A) R)->(forall (S:fofType), (((breln1 A) S)->((breln1 A) ((binunion R) S))))))) % Found (fun (x:subsetI1) (x0:subsetE) (x1:binunionEcases) (A:fofType) (R:fofType) (x2:((breln1 A) R)) (S:fofType) (x3:((breln1 A) S))=> (((x ((binunion R) S)) ((cartprod A) A)) (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx))))) as proof of (subsetE->(binunionEcases->(forall (A:fofType) (R:fofType), (((breln1 A) R)->(forall (S:fofType), (((breln1 A) S)->((breln1 A) ((binunion R) S)))))))) % Found (fun (x:subsetI1) (x0:subsetE) (x1:binunionEcases) (A:fofType) (R:fofType) (x2:((breln1 A) R)) (S:fofType) (x3:((breln1 A) S))=> (((x ((binunion R) S)) ((cartprod A) A)) (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx))))) as proof of (subsetI1->(subsetE->(binunionEcases->(forall (A:fofType) (R:fofType), (((breln1 A) R)->(forall (S:fofType), (((breln1 A) S)->((breln1 A) ((binunion R) S))))))))) % Got proof (fun (x:subsetI1) (x0:subsetE) (x1:binunionEcases) (A:fofType) (R:fofType) (x2:((breln1 A) R)) (S:fofType) (x3:((breln1 A) S))=> (((x ((binunion R) S)) ((cartprod A) A)) (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx))))) % Time elapsed = 1.053997s % node=241 cost=2129.000000 depth=24 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:subsetI1) (x0:subsetE) (x1:binunionEcases) (A:fofType) (R:fofType) (x2:((breln1 A) R)) (S:fofType) (x3:((breln1 A) S))=> (((x ((binunion R) S)) ((cartprod A) A)) (fun (Xx:fofType) (x5:((in Xx) ((binunion R) S)))=> (((((((x1 R) S) Xx) ((in Xx) ((cartprod A) A))) x5) ((fun (Xx1:fofType)=> ((((x0 R) ((cartprod A) A)) Xx1) x2)) Xx)) ((fun (Xx1:fofType)=> ((((x0 S) ((cartprod A) A)) Xx1) x3)) Xx))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------