↑ Up

cocATP---0.2.0.THM-Prf.s

View TPTP
Problem Process solution in
SystemOnTSTP Download .tgz 
%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEU738^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 : n107.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:58 EDT 2014

% Result   : Theorem 0.48s
% Output   : Proof 0.48s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU738^2 : TPTP v6.1.0. Released v3.7.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n107.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:20:46 CDT 2014
% % CPUTime  : 0.48 
% 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 0xd6a560>, <kernel.DependentProduct object at 0xf4d680>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x119ba70>, <kernel.DependentProduct object at 0xf4d440>) of role type named powerset_type
% Using role type
% Declaring powerset:(fofType->fofType)
% FOF formula (<kernel.Constant object at 0x119ba70>, <kernel.DependentProduct object at 0xf4d440>) of role type named binunion_type
% Using role type
% Declaring binunion:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0xd6a710>, <kernel.Sort object at 0xc30bd8>) of role type named binunionIL_type
% Using role type
% Declaring binunionIL:Prop
% FOF formula (((eq Prop) binunionIL) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B))))) of role definition named binunionIL
% A new definition: (((eq Prop) binunionIL) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))))
% Defined: binunionIL:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B))))
% FOF formula (binunionIL->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) X)->False))))))))) of role conjecture named binunionTILcontra
% Conjecture to prove = (binunionIL->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) X)->False))))))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(binunionIL->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) X)->False)))))))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter powerset:(fofType->fofType).
% Parameter binunion:(fofType->(fofType->fofType)).
% Definition binunionIL:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))):Prop.
% Trying to prove (binunionIL->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) X)->False)))))))))
% Found x5000:=(x500 x4):((in Xx) ((binunion X) Y))
% Found (x500 x4) as proof of ((in Xx) ((binunion X) Y))
% Found ((x50 Xx) x4) as proof of ((in Xx) ((binunion X) Y))
% Found (((x5 Y) Xx) x4) as proof of ((in Xx) ((binunion X) Y))
% Found ((((x X) Y) Xx) x4) as proof of ((in Xx) ((binunion X) Y))
% Found ((((x X) Y) Xx) x4) as proof of ((in Xx) ((binunion X) Y))
% Found (x3 ((((x X) Y) Xx) x4)) as proof of False
% Found (fun (x4:((in Xx) X))=> (x3 ((((x X) Y) Xx) x4))) as proof of False
% Found (fun (x3:(((in Xx) ((binunion X) Y))->False)) (x4:((in Xx) X))=> (x3 ((((x X) Y) Xx) x4))) as proof of (((in Xx) X)->False)
% Found (fun (x2:((in Xx) A)) (x3:(((in Xx) ((binunion X) Y))->False)) (x4:((in Xx) X))=> (x3 ((((x X) Y) Xx) x4))) as proof of ((((in Xx) ((binunion X) Y))->False)->(((in Xx) X)->False))
% Found (fun (Xx:fofType) (x2:((in Xx) A)) (x3:(((in Xx) ((binunion X) Y))->False)) (x4:((in Xx) X))=> (x3 ((((x X) Y) Xx) x4))) as proof of (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) X)->False)))
% Found (fun (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:(((in Xx) ((binunion X) Y))->False)) (x4:((in Xx) X))=> (x3 ((((x X) Y) Xx) x4))) as proof of (forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) X)->False))))
% Found (fun (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:(((in Xx) ((binunion X) Y))->False)) (x4:((in Xx) X))=> (x3 ((((x X) Y) Xx) x4))) as proof of (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) X)->False)))))
% Found (fun (x0:((in X) (powerset A))) (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:(((in Xx) ((binunion X) Y))->False)) (x4:((in Xx) X))=> (x3 ((((x X) Y) Xx) x4))) as proof of (forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) X)->False))))))
% Found (fun (X:fofType) (x0:((in X) (powerset A))) (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:(((in Xx) ((binunion X) Y))->False)) (x4:((in Xx) X))=> (x3 ((((x X) Y) Xx) x4))) as proof of (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) X)->False)))))))
% Found (fun (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:(((in Xx) ((binunion X) Y))->False)) (x4:((in Xx) X))=> (x3 ((((x X) Y) Xx) x4))) as proof of (forall (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) X)->False))))))))
% Found (fun (x:binunionIL) (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:(((in Xx) ((binunion X) Y))->False)) (x4:((in Xx) X))=> (x3 ((((x X) Y) Xx) x4))) as proof of (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) X)->False))))))))
% Found (fun (x:binunionIL) (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:(((in Xx) ((binunion X) Y))->False)) (x4:((in Xx) X))=> (x3 ((((x X) Y) Xx) x4))) as proof of (binunionIL->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) X)->False)))))))))
% Got proof (fun (x:binunionIL) (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:(((in Xx) ((binunion X) Y))->False)) (x4:((in Xx) X))=> (x3 ((((x X) Y) Xx) x4)))
% Time elapsed = 0.161544s
% node=32 cost=207.000000 depth=16
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:binunionIL) (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:(((in Xx) ((binunion X) Y))->False)) (x4:((in Xx) X))=> (x3 ((((x X) Y) Xx) x4)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------