%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : LCL579^1 : TPTP v6.1.0. Released v3.6.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:25:48 EDT 2014 % Result : Theorem 0.37s % Output : Proof 0.37s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : LCL579^1 : TPTP v6.1.0. Released v3.6.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 10:00:11 CDT 2014 % % CPUTime : 0.37 % Python 2.7.5 % Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/'] % FOF formula (forall (X:fofType) (Y:fofType), ((forall (P:(fofType->Prop)), ((P X)->(P Y)))->(forall (P:(fofType->Prop)), ((P Y)->(P X))))) of role conjecture named a % Conjecture to prove = (forall (X:fofType) (Y:fofType), ((forall (P:(fofType->Prop)), ((P X)->(P Y)))->(forall (P:(fofType->Prop)), ((P Y)->(P X))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(forall (X:fofType) (Y:fofType), ((forall (P:(fofType->Prop)), ((P X)->(P Y)))->(forall (P:(fofType->Prop)), ((P Y)->(P X)))))'] % Parameter fofType:Type. % Trying to prove (forall (X:fofType) (Y:fofType), ((forall (P:(fofType->Prop)), ((P X)->(P Y)))->(forall (P:(fofType->Prop)), ((P Y)->(P X))))) % Found eq_sym0:=(eq_sym fofType):(forall (a:fofType) (b:fofType), ((((eq fofType) a) b)->(((eq fofType) b) a))) % Found (eq_sym fofType) as proof of (forall (X:fofType) (Y:fofType), ((((eq fofType) X) Y)->(((eq fofType) Y) X))) % Found (eq_sym fofType) as proof of (forall (X:fofType) (Y:fofType), ((((eq fofType) X) Y)->(((eq fofType) Y) X))) % Found (eq_sym fofType) as proof of (forall (X:fofType) (Y:fofType), ((forall (P:(fofType->Prop)), ((P X)->(P Y)))->(forall (P:(fofType->Prop)), ((P Y)->(P X))))) % Got proof (eq_sym fofType) % Time elapsed = 0.062627s % node=9 cost=-48.000000 depth=2 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (eq_sym fofType) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------