%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU560^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 : n093.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:28 EDT 2014 % Result : Theorem 0.56s % Output : Proof 0.56s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU560^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n093.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:43:31 CDT 2014 % % CPUTime : 0.56 % 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 0x1200a70>, <kernel.DependentProduct object at 0x13b92d8>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1200830>, <kernel.DependentProduct object at 0x13b92d8>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (((eq (fofType->(fofType->Prop))) subset) (fun (A:fofType) (B:fofType)=> (forall (Xx:fofType), (((in Xx) A)->((in Xx) B))))) of role definition named subset % A new definition: (((eq (fofType->(fofType->Prop))) subset) (fun (A:fofType) (B:fofType)=> (forall (Xx:fofType), (((in Xx) A)->((in Xx) B))))) % Defined: subset:=(fun (A:fofType) (B:fofType)=> (forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))) % FOF formula (<kernel.Constant object at 0x1200830>, <kernel.Sort object at 0x10cbab8>) 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 (subsetI1->(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->((subset B) A)))) of role conjecture named eqimpsubset2 % Conjecture to prove = (subsetI1->(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->((subset B) A)))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(subsetI1->(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->((subset B) A))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Definition subset:=(fun (A:fofType) (B:fofType)=> (forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))):(fofType->(fofType->Prop)). % Definition subsetI1:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))):Prop. % Trying to prove (subsetI1->(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->((subset B) A)))) % Found eq_ref000:=(eq_ref00 (in Xx)):(((in Xx) A)->((in Xx) A)) % Found (eq_ref00 (in Xx)) as proof of (((in Xx) A)->((in Xx) A)) % Found ((eq_ref0 A) (in Xx)) as proof of (((in Xx) A)->((in Xx) A)) % Found (((eq_ref fofType) A) (in Xx)) as proof of (((in Xx) A)->((in Xx) A)) % Found (fun (Xx:fofType)=> (((eq_ref fofType) A) (in Xx))) as proof of (((in Xx) A)->((in Xx) A)) % Found (fun (Xx:fofType)=> (((eq_ref fofType) A) (in Xx))) as proof of ((subset A) A) % Found (x00 (fun (Xx:fofType)=> (((eq_ref fofType) A) (in Xx)))) as proof of ((subset B) A) % Found ((x0 (fun (x2:fofType)=> ((subset x2) A))) (fun (Xx:fofType)=> (((eq_ref fofType) A) (in Xx)))) as proof of ((subset B) A) % Found (fun (x0:(((eq fofType) A) B))=> ((x0 (fun (x2:fofType)=> ((subset x2) A))) (fun (Xx:fofType)=> (((eq_ref fofType) A) (in Xx))))) as proof of ((subset B) A) % Found (fun (B:fofType) (x0:(((eq fofType) A) B))=> ((x0 (fun (x2:fofType)=> ((subset x2) A))) (fun (Xx:fofType)=> (((eq_ref fofType) A) (in Xx))))) as proof of ((((eq fofType) A) B)->((subset B) A)) % Found (fun (A:fofType) (B:fofType) (x0:(((eq fofType) A) B))=> ((x0 (fun (x2:fofType)=> ((subset x2) A))) (fun (Xx:fofType)=> (((eq_ref fofType) A) (in Xx))))) as proof of (forall (B:fofType), ((((eq fofType) A) B)->((subset B) A))) % Found (fun (x:subsetI1) (A:fofType) (B:fofType) (x0:(((eq fofType) A) B))=> ((x0 (fun (x2:fofType)=> ((subset x2) A))) (fun (Xx:fofType)=> (((eq_ref fofType) A) (in Xx))))) as proof of (forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->((subset B) A))) % Found (fun (x:subsetI1) (A:fofType) (B:fofType) (x0:(((eq fofType) A) B))=> ((x0 (fun (x2:fofType)=> ((subset x2) A))) (fun (Xx:fofType)=> (((eq_ref fofType) A) (in Xx))))) as proof of (subsetI1->(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->((subset B) A)))) % Got proof (fun (x:subsetI1) (A:fofType) (B:fofType) (x0:(((eq fofType) A) B))=> ((x0 (fun (x2:fofType)=> ((subset x2) A))) (fun (Xx:fofType)=> (((eq_ref fofType) A) (in Xx))))) % Time elapsed = 0.243876s % node=32 cost=-200.000000 depth=11 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:subsetI1) (A:fofType) (B:fofType) (x0:(((eq fofType) A) B))=> ((x0 (fun (x2:fofType)=> ((subset x2) A))) (fun (Xx:fofType)=> (((eq_ref fofType) A) (in Xx))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------