%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SET194^5 : TPTP v6.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n117.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:30:21 EDT 2014 % Result : Theorem 0.35s % Output : Proof 0.35s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SET194^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n117.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 09:22:06 CDT 2014 % % CPUTime : 0.35 % 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 0x20b94d0>, <kernel.Type object at 0x20b9200>) of role type named a_type % Using role type % Declaring a:Type % FOF formula (forall (X:(a->Prop)) (Y:(a->Prop)) (Xx:a), ((X Xx)->((or (X Xx)) (Y Xx)))) of role conjecture named cBOOL_PROP_31_pme % Conjecture to prove = (forall (X:(a->Prop)) (Y:(a->Prop)) (Xx:a), ((X Xx)->((or (X Xx)) (Y Xx)))):Prop % Parameter a_DUMMY:a. % We need to prove ['(forall (X:(a->Prop)) (Y:(a->Prop)) (Xx:a), ((X Xx)->((or (X Xx)) (Y Xx))))'] % Parameter a:Type. % Trying to prove (forall (X:(a->Prop)) (Y:(a->Prop)) (Xx:a), ((X Xx)->((or (X Xx)) (Y Xx)))) % Found or_introl00:=(or_introl0 (Y Xx)):((X Xx)->((or (X Xx)) (Y Xx))) % Found (or_introl0 (Y Xx)) as proof of ((X Xx)->((or (X Xx)) (Y Xx))) % Found ((or_introl (X Xx)) (Y Xx)) as proof of ((X Xx)->((or (X Xx)) (Y Xx))) % Found (fun (Xx:a)=> ((or_introl (X Xx)) (Y Xx))) as proof of ((X Xx)->((or (X Xx)) (Y Xx))) % Found (fun (Y:(a->Prop)) (Xx:a)=> ((or_introl (X Xx)) (Y Xx))) as proof of (forall (Xx:a), ((X Xx)->((or (X Xx)) (Y Xx)))) % Found (fun (X:(a->Prop)) (Y:(a->Prop)) (Xx:a)=> ((or_introl (X Xx)) (Y Xx))) as proof of (forall (Y:(a->Prop)) (Xx:a), ((X Xx)->((or (X Xx)) (Y Xx)))) % Found (fun (X:(a->Prop)) (Y:(a->Prop)) (Xx:a)=> ((or_introl (X Xx)) (Y Xx))) as proof of (forall (X:(a->Prop)) (Y:(a->Prop)) (Xx:a), ((X Xx)->((or (X Xx)) (Y Xx)))) % Got proof (fun (X:(a->Prop)) (Y:(a->Prop)) (Xx:a)=> ((or_introl (X Xx)) (Y Xx))) % Time elapsed = 0.042270s % node=6 cost=-179.000000 depth=5 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (X:(a->Prop)) (Y:(a->Prop)) (Xx:a)=> ((or_introl (X Xx)) (Y Xx))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------