%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU700^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 : n115.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:51 EDT 2014 % Result : Theorem 2.25s % Output : Proof 2.25s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU700^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n115.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:14:41 CDT 2014 % % CPUTime : 2.25 % 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 0x158fb90>, <kernel.DependentProduct object at 0x158f8c0>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x178cab8>, <kernel.DependentProduct object at 0x158f998>) of role type named dsetconstr_type % Using role type % Declaring dsetconstr:(fofType->((fofType->Prop)->fofType)) % FOF formula (<kernel.Constant object at 0x158f7e8>, <kernel.Sort object at 0x1474ea8>) of role type named dsetconstrI_type % Using role type % Declaring dsetconstrI:Prop % FOF formula (((eq Prop) dsetconstrI) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))))) of role definition named dsetconstrI % A new definition: (((eq Prop) dsetconstrI) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))))) % Defined: dsetconstrI:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))))) % FOF formula (dsetconstrI->(forall (A:fofType) (Xphi:Prop) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->((Xphi->False)->((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy)))))))))))) of role conjecture named iffalseProp1 % Conjecture to prove = (dsetconstrI->(forall (A:fofType) (Xphi:Prop) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->((Xphi->False)->((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy)))))))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(dsetconstrI->(forall (A:fofType) (Xphi:Prop) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->((Xphi->False)->((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy))))))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter dsetconstr:(fofType->((fofType->Prop)->fofType)). % Definition dsetconstrI:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))))):Prop. % Trying to prove (dsetconstrI->(forall (A:fofType) (Xphi:Prop) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->((Xphi->False)->((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy)))))))))))) % Found x1:((in Xy) A) % Found x1 as proof of ((in Xy) A) % Found x1:((in Xy) A) % Found x1 as proof of ((in Xy) A) % Found eq_ref00:=(eq_ref0 Xy):(((eq fofType) Xy) Xy) % Found (eq_ref0 Xy) as proof of (((eq fofType) Xy) Xy) % Found ((eq_ref fofType) Xy) as proof of (((eq fofType) Xy) Xy) % Found ((eq_ref fofType) Xy) as proof of (((eq fofType) Xy) Xy) % Found (conj000 ((eq_ref fofType) Xy)) as proof of ((and (Xphi->False)) (((eq fofType) Xy) Xy)) % Found ((conj00 (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy)) as proof of ((and (Xphi->False)) (((eq fofType) Xy) Xy)) % Found (((fun (B:Prop)=> ((conj0 B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy)) as proof of ((and (Xphi->False)) (((eq fofType) Xy) Xy)) % Found (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy)) as proof of ((and (Xphi->False)) (((eq fofType) Xy) Xy)) % Found (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy)) as proof of ((and (Xphi->False)) (((eq fofType) Xy) Xy)) % Found (or_intror00 (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))) as proof of ((or ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) % Found ((or_intror0 ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))) as proof of ((or ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) % Found (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))) as proof of ((or ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) % Found (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))) as proof of ((or ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) % Found ((x300 x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy)))) as proof of ((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy)))))) % Found (((x30 Xy) x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy)))) as proof of ((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy)))))) % Found ((((x3 (fun (x7:fofType)=> ((or ((and Xphi) (((eq fofType) x7) Xx))) ((and (Xphi->False)) (((eq fofType) x7) Xy))))) Xy) x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy)))) as proof of ((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy)))))) % Found (((((x A) (fun (x7:fofType)=> ((or ((and Xphi) (((eq fofType) x7) Xx))) ((and (Xphi->False)) (((eq fofType) x7) Xy))))) Xy) x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy)))) as proof of ((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy)))))) % Found (fun (x2:(Xphi->False))=> (((((x A) (fun (x7:fofType)=> ((or ((and Xphi) (((eq fofType) x7) Xx))) ((and (Xphi->False)) (((eq fofType) x7) Xy))))) Xy) x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))))) as proof of ((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy)))))) % Found (fun (x1:((in Xy) A)) (x2:(Xphi->False))=> (((((x A) (fun (x7:fofType)=> ((or ((and Xphi) (((eq fofType) x7) Xx))) ((and (Xphi->False)) (((eq fofType) x7) Xy))))) Xy) x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))))) as proof of ((Xphi->False)->((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy))))))) % Found (fun (Xy:fofType) (x1:((in Xy) A)) (x2:(Xphi->False))=> (((((x A) (fun (x7:fofType)=> ((or ((and Xphi) (((eq fofType) x7) Xx))) ((and (Xphi->False)) (((eq fofType) x7) Xy))))) Xy) x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))))) as proof of (((in Xy) A)->((Xphi->False)->((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy)))))))) % Found (fun (x0:((in Xx) A)) (Xy:fofType) (x1:((in Xy) A)) (x2:(Xphi->False))=> (((((x A) (fun (x7:fofType)=> ((or ((and Xphi) (((eq fofType) x7) Xx))) ((and (Xphi->False)) (((eq fofType) x7) Xy))))) Xy) x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))))) as proof of (forall (Xy:fofType), (((in Xy) A)->((Xphi->False)->((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy))))))))) % Found (fun (Xx:fofType) (x0:((in Xx) A)) (Xy:fofType) (x1:((in Xy) A)) (x2:(Xphi->False))=> (((((x A) (fun (x7:fofType)=> ((or ((and Xphi) (((eq fofType) x7) Xx))) ((and (Xphi->False)) (((eq fofType) x7) Xy))))) Xy) x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))))) as proof of (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->((Xphi->False)->((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy)))))))))) % Found (fun (Xphi:Prop) (Xx:fofType) (x0:((in Xx) A)) (Xy:fofType) (x1:((in Xy) A)) (x2:(Xphi->False))=> (((((x A) (fun (x7:fofType)=> ((or ((and Xphi) (((eq fofType) x7) Xx))) ((and (Xphi->False)) (((eq fofType) x7) Xy))))) Xy) x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))))) as proof of (forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->((Xphi->False)->((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy))))))))))) % Found (fun (A:fofType) (Xphi:Prop) (Xx:fofType) (x0:((in Xx) A)) (Xy:fofType) (x1:((in Xy) A)) (x2:(Xphi->False))=> (((((x A) (fun (x7:fofType)=> ((or ((and Xphi) (((eq fofType) x7) Xx))) ((and (Xphi->False)) (((eq fofType) x7) Xy))))) Xy) x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))))) as proof of (forall (Xphi:Prop) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->((Xphi->False)->((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy))))))))))) % Found (fun (x:dsetconstrI) (A:fofType) (Xphi:Prop) (Xx:fofType) (x0:((in Xx) A)) (Xy:fofType) (x1:((in Xy) A)) (x2:(Xphi->False))=> (((((x A) (fun (x7:fofType)=> ((or ((and Xphi) (((eq fofType) x7) Xx))) ((and (Xphi->False)) (((eq fofType) x7) Xy))))) Xy) x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))))) as proof of (forall (A:fofType) (Xphi:Prop) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->((Xphi->False)->((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy))))))))))) % Found (fun (x:dsetconstrI) (A:fofType) (Xphi:Prop) (Xx:fofType) (x0:((in Xx) A)) (Xy:fofType) (x1:((in Xy) A)) (x2:(Xphi->False))=> (((((x A) (fun (x7:fofType)=> ((or ((and Xphi) (((eq fofType) x7) Xx))) ((and (Xphi->False)) (((eq fofType) x7) Xy))))) Xy) x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))))) as proof of (dsetconstrI->(forall (A:fofType) (Xphi:Prop) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->((Xphi->False)->((in Xy) ((dsetconstr A) (fun (Xz:fofType)=> ((or ((and Xphi) (((eq fofType) Xz) Xx))) ((and (Xphi->False)) (((eq fofType) Xz) Xy)))))))))))) % Got proof (fun (x:dsetconstrI) (A:fofType) (Xphi:Prop) (Xx:fofType) (x0:((in Xx) A)) (Xy:fofType) (x1:((in Xy) A)) (x2:(Xphi->False))=> (((((x A) (fun (x7:fofType)=> ((or ((and Xphi) (((eq fofType) x7) Xx))) ((and (Xphi->False)) (((eq fofType) x7) Xy))))) Xy) x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))))) % Time elapsed = 1.915020s % node=419 cost=371.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:dsetconstrI) (A:fofType) (Xphi:Prop) (Xx:fofType) (x0:((in Xx) A)) (Xy:fofType) (x1:((in Xy) A)) (x2:(Xphi->False))=> (((((x A) (fun (x7:fofType)=> ((or ((and Xphi) (((eq fofType) x7) Xx))) ((and (Xphi->False)) (((eq fofType) x7) Xy))))) Xy) x1) (((or_intror ((and Xphi) (((eq fofType) Xy) Xx))) ((and (Xphi->False)) (((eq fofType) Xy) Xy))) (((fun (B:Prop)=> (((conj (Xphi->False)) B) x2)) (((eq fofType) Xy) Xy)) ((eq_ref fofType) Xy))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------