%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU530^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 : n186.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:23 EDT 2014 % Result : Theorem 0.71s % Output : Proof 0.71s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU530^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n186.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:32:01 CDT 2014 % % CPUTime : 0.71 % 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 0x2003ef0>, <kernel.DependentProduct object at 0x2003cb0>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x2059ef0>, <kernel.Single object at 0x2003050>) of role type named emptyset_type % Using role type % Declaring emptyset:fofType % FOF formula (<kernel.Constant object at 0x2003cb0>, <kernel.DependentProduct object at 0x2003cf8>) of role type named setadjoin_type % Using role type % Declaring setadjoin:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x2003368>, <kernel.Sort object at 0x1af0098>) of role type named uniqinunit_type % Using role type % Declaring uniqinunit:Prop % FOF formula (((eq Prop) uniqinunit) (forall (Xx:fofType) (Xy:fofType), (((in Xx) ((setadjoin Xy) emptyset))->(((eq fofType) Xx) Xy)))) of role definition named uniqinunit % A new definition: (((eq Prop) uniqinunit) (forall (Xx:fofType) (Xy:fofType), (((in Xx) ((setadjoin Xy) emptyset))->(((eq fofType) Xx) Xy)))) % Defined: uniqinunit:=(forall (Xx:fofType) (Xy:fofType), (((in Xx) ((setadjoin Xy) emptyset))->(((eq fofType) Xx) Xy))) % FOF formula (<kernel.Constant object at 0x20036c8>, <kernel.Sort object at 0x1af0098>) of role type named eqinunit_type % Using role type % Declaring eqinunit:Prop % FOF formula (((eq Prop) eqinunit) (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((in Xx) ((setadjoin Xy) emptyset))))) of role definition named eqinunit % A new definition: (((eq Prop) eqinunit) (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((in Xx) ((setadjoin Xy) emptyset))))) % Defined: eqinunit:=(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((in Xx) ((setadjoin Xy) emptyset)))) % FOF formula (uniqinunit->(eqinunit->(forall (Xx:fofType) (Xy:fofType), (((in Xx) ((setadjoin Xy) emptyset))->((in Xy) ((setadjoin Xx) emptyset)))))) of role conjecture named singletonsswitch % Conjecture to prove = (uniqinunit->(eqinunit->(forall (Xx:fofType) (Xy:fofType), (((in Xx) ((setadjoin Xy) emptyset))->((in Xy) ((setadjoin Xx) emptyset)))))):Prop % We need to prove ['(uniqinunit->(eqinunit->(forall (Xx:fofType) (Xy:fofType), (((in Xx) ((setadjoin Xy) emptyset))->((in Xy) ((setadjoin Xx) emptyset))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter emptyset:fofType. % Parameter setadjoin:(fofType->(fofType->fofType)). % Definition uniqinunit:=(forall (Xx:fofType) (Xy:fofType), (((in Xx) ((setadjoin Xy) emptyset))->(((eq fofType) Xx) Xy))):Prop. % Definition eqinunit:=(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((in Xx) ((setadjoin Xy) emptyset)))):Prop. % Trying to prove (uniqinunit->(eqinunit->(forall (Xx:fofType) (Xy:fofType), (((in Xx) ((setadjoin Xy) emptyset))->((in Xy) ((setadjoin Xx) emptyset)))))) % Found x200:=(x20 x1):(((eq fofType) Xx) Xy) % Found (x20 x1) as proof of (((eq fofType) Xx) Xy) % Found ((x2 Xy) x1) as proof of (((eq fofType) Xx) Xy) % Found (((x Xx) Xy) x1) as proof of (((eq fofType) Xx) Xy) % Found (((x Xx) Xy) x1) as proof of (((eq fofType) Xx) Xy) % Found (eq_sym000 (((x Xx) Xy) x1)) as proof of (((eq fofType) Xy) Xx) % Found ((eq_sym00 Xy) (((x Xx) Xy) x1)) as proof of (((eq fofType) Xy) Xx) % Found (((eq_sym0 Xx) Xy) (((x Xx) Xy) x1)) as proof of (((eq fofType) Xy) Xx) % Found ((((eq_sym fofType) Xx) Xy) (((x Xx) Xy) x1)) as proof of (((eq fofType) Xy) Xx) % Found ((((eq_sym fofType) Xx) Xy) (((x Xx) Xy) x1)) as proof of (((eq fofType) Xy) Xx) % Found (x000 ((((eq_sym fofType) Xx) Xy) (((x Xx) Xy) x1))) as proof of ((in Xy) ((setadjoin Xx) emptyset)) % Found ((x00 Xx) ((((eq_sym fofType) Xx) Xy) (((x Xx) Xy) x1))) as proof of ((in Xy) ((setadjoin Xx) emptyset)) % Found (((x0 Xy) Xx) ((((eq_sym fofType) Xx) Xy) (((x Xx) Xy) x1))) as proof of ((in Xy) ((setadjoin Xx) emptyset)) % Found (fun (x1:((in Xx) ((setadjoin Xy) emptyset)))=> (((x0 Xy) Xx) ((((eq_sym fofType) Xx) Xy) (((x Xx) Xy) x1)))) as proof of ((in Xy) ((setadjoin Xx) emptyset)) % Found (fun (Xy:fofType) (x1:((in Xx) ((setadjoin Xy) emptyset)))=> (((x0 Xy) Xx) ((((eq_sym fofType) Xx) Xy) (((x Xx) Xy) x1)))) as proof of (((in Xx) ((setadjoin Xy) emptyset))->((in Xy) ((setadjoin Xx) emptyset))) % Found (fun (Xx:fofType) (Xy:fofType) (x1:((in Xx) ((setadjoin Xy) emptyset)))=> (((x0 Xy) Xx) ((((eq_sym fofType) Xx) Xy) (((x Xx) Xy) x1)))) as proof of (forall (Xy:fofType), (((in Xx) ((setadjoin Xy) emptyset))->((in Xy) ((setadjoin Xx) emptyset)))) % Found (fun (x0:eqinunit) (Xx:fofType) (Xy:fofType) (x1:((in Xx) ((setadjoin Xy) emptyset)))=> (((x0 Xy) Xx) ((((eq_sym fofType) Xx) Xy) (((x Xx) Xy) x1)))) as proof of (forall (Xx:fofType) (Xy:fofType), (((in Xx) ((setadjoin Xy) emptyset))->((in Xy) ((setadjoin Xx) emptyset)))) % Found (fun (x:uniqinunit) (x0:eqinunit) (Xx:fofType) (Xy:fofType) (x1:((in Xx) ((setadjoin Xy) emptyset)))=> (((x0 Xy) Xx) ((((eq_sym fofType) Xx) Xy) (((x Xx) Xy) x1)))) as proof of (eqinunit->(forall (Xx:fofType) (Xy:fofType), (((in Xx) ((setadjoin Xy) emptyset))->((in Xy) ((setadjoin Xx) emptyset))))) % Found (fun (x:uniqinunit) (x0:eqinunit) (Xx:fofType) (Xy:fofType) (x1:((in Xx) ((setadjoin Xy) emptyset)))=> (((x0 Xy) Xx) ((((eq_sym fofType) Xx) Xy) (((x Xx) Xy) x1)))) as proof of (uniqinunit->(eqinunit->(forall (Xx:fofType) (Xy:fofType), (((in Xx) ((setadjoin Xy) emptyset))->((in Xy) ((setadjoin Xx) emptyset)))))) % Got proof (fun (x:uniqinunit) (x0:eqinunit) (Xx:fofType) (Xy:fofType) (x1:((in Xx) ((setadjoin Xy) emptyset)))=> (((x0 Xy) Xx) ((((eq_sym fofType) Xx) Xy) (((x Xx) Xy) x1)))) % Time elapsed = 0.383656s % node=72 cost=344.000000 depth=17 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:uniqinunit) (x0:eqinunit) (Xx:fofType) (Xy:fofType) (x1:((in Xx) ((setadjoin Xy) emptyset)))=> (((x0 Xy) Xx) ((((eq_sym fofType) Xx) Xy) (((x Xx) Xy) x1)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------