↑ Up

cocATP---0.2.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SYO361^5 : TPTP v7.5.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n023.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 0s
% DateTime : Tue Mar 29 00:51:15 EDT 2022

% Result   : Theorem 1.11s 1.25s
% Output   : Proof 1.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11  % Problem    : SYO361^5 : TPTP v7.5.0. Released v4.0.0.
% 0.04/0.12  % Command    : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.33  % Computer   : n023.cluster.edu
% 0.12/0.33  % Model      : x86_64 x86_64
% 0.12/0.33  % CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % RAMPerCPU  : 8042.1875MB
% 0.12/0.33  % OS         : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % DateTime   : Sat Mar 12 07:25:11 EST 2022
% 0.12/0.33  % CPUTime    : 
% 0.12/0.34  ModuleCmd_Load.c(213):ERROR:105: Unable to locate a modulefile for 'python/python27'
% 0.12/0.34  Python 2.7.5
% 1.08/1.25  Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% 1.08/1.25  FOF formula (forall (X:fofType) (Y:fofType), ((iff (((eq fofType) X) Y)) (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))) of role conjecture named cTHM47
% 1.08/1.25  Conjecture to prove = (forall (X:fofType) (Y:fofType), ((iff (((eq fofType) X) Y)) (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))):Prop
% 1.08/1.25  Parameter fofType_DUMMY:fofType.
% 1.08/1.25  We need to prove ['(forall (X:fofType) (Y:fofType), ((iff (((eq fofType) X) Y)) (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))))']
% 1.08/1.25  Parameter fofType:Type.
% 1.08/1.25  Trying to prove (forall (X:fofType) (Y:fofType), ((iff (((eq fofType) X) Y)) (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))))
% 1.08/1.25  Found eq_ref0:=(eq_ref fofType):(forall (a:fofType), (((eq fofType) a) a))
% 1.08/1.25  Found (eq_ref fofType) as proof of (forall (Z:fofType), (((eq fofType) Z) Z))
% 1.08/1.25  Found (eq_ref fofType) as proof of (forall (Z:fofType), (((eq fofType) Z) Z))
% 1.08/1.25  Found (x0 (eq_ref fofType)) as proof of (((eq fofType) X) Y)
% 1.08/1.25  Found ((x (eq fofType)) (eq_ref fofType)) as proof of (((eq fofType) X) Y)
% 1.08/1.25  Found (fun (x:(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))=> ((x (eq fofType)) (eq_ref fofType))) as proof of (((eq fofType) X) Y)
% 1.08/1.25  Found (fun (x:(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))=> ((x (eq fofType)) (eq_ref fofType))) as proof of ((forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))->(((eq fofType) X) Y))
% 1.08/1.25  Found x000:=(x00 X):((R X) X)
% 1.08/1.25  Found (x00 X) as proof of ((R X) X)
% 1.08/1.25  Found (fun (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X)) as proof of ((R X) X)
% 1.08/1.25  Found (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X)) as proof of ((forall (Z:fofType), ((R Z) Z))->((R X) X))
% 1.08/1.25  Found (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X)) as proof of (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) X)))
% 1.08/1.25  Found (x0 (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X))) as proof of (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))
% 1.08/1.25  Found ((x (fun (x1:fofType)=> (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) x1))))) (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X))) as proof of (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))
% 1.08/1.25  Found (fun (x:(((eq fofType) X) Y))=> ((x (fun (x1:fofType)=> (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) x1))))) (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X)))) as proof of (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))
% 1.08/1.25  Found (fun (x:(((eq fofType) X) Y))=> ((x (fun (x1:fofType)=> (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) x1))))) (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X)))) as proof of ((((eq fofType) X) Y)->(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))
% 1.08/1.25  Found ((conj00 (fun (x:(((eq fofType) X) Y))=> ((x (fun (x1:fofType)=> (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) x1))))) (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X))))) (fun (x:(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))=> ((x (eq fofType)) (eq_ref fofType)))) as proof of ((and ((((eq fofType) X) Y)->(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))) ((forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))->(((eq fofType) X) Y)))
% 1.08/1.25  Found (((conj0 ((forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))->(((eq fofType) X) Y))) (fun (x:(((eq fofType) X) Y))=> ((x (fun (x1:fofType)=> (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) x1))))) (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X))))) (fun (x:(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))=> ((x (eq fofType)) (eq_ref fofType)))) as proof of ((and ((((eq fofType) X) Y)->(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))) ((forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))->(((eq fofType) X) Y)))
% 1.08/1.25  Found ((((conj ((((eq fofType) X) Y)->(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))) ((forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))->(((eq fofType) X) Y))) (fun (x:(((eq fofType) X) Y))=> ((x (fun (x1:fofType)=> (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) x1))))) (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X))))) (fun (x:(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))=> ((x (eq fofType)) (eq_ref fofType)))) as proof of ((and ((((eq fofType) X) Y)->(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))) ((forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))->(((eq fofType) X) Y)))
% 1.08/1.25  Found ((((conj ((((eq fofType) X) Y)->(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))) ((forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))->(((eq fofType) X) Y))) (fun (x:(((eq fofType) X) Y))=> ((x (fun (x1:fofType)=> (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) x1))))) (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X))))) (fun (x:(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))=> ((x (eq fofType)) (eq_ref fofType)))) as proof of ((and ((((eq fofType) X) Y)->(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))) ((forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))->(((eq fofType) X) Y)))
% 1.08/1.25  Found (fun (Y:fofType)=> ((((conj ((((eq fofType) X) Y)->(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))) ((forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))->(((eq fofType) X) Y))) (fun (x:(((eq fofType) X) Y))=> ((x (fun (x1:fofType)=> (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) x1))))) (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X))))) (fun (x:(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))=> ((x (eq fofType)) (eq_ref fofType))))) as proof of ((iff (((eq fofType) X) Y)) (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))
% 1.08/1.25  Found (fun (X:fofType) (Y:fofType)=> ((((conj ((((eq fofType) X) Y)->(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))) ((forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))->(((eq fofType) X) Y))) (fun (x:(((eq fofType) X) Y))=> ((x (fun (x1:fofType)=> (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) x1))))) (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X))))) (fun (x:(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))=> ((x (eq fofType)) (eq_ref fofType))))) as proof of (forall (Y:fofType), ((iff (((eq fofType) X) Y)) (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))))
% 1.08/1.25  Found (fun (X:fofType) (Y:fofType)=> ((((conj ((((eq fofType) X) Y)->(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))) ((forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))->(((eq fofType) X) Y))) (fun (x:(((eq fofType) X) Y))=> ((x (fun (x1:fofType)=> (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) x1))))) (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X))))) (fun (x:(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))=> ((x (eq fofType)) (eq_ref fofType))))) as proof of (forall (X:fofType) (Y:fofType), ((iff (((eq fofType) X) Y)) (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))))
% 1.11/1.25  Got proof (fun (X:fofType) (Y:fofType)=> ((((conj ((((eq fofType) X) Y)->(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))) ((forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))->(((eq fofType) X) Y))) (fun (x:(((eq fofType) X) Y))=> ((x (fun (x1:fofType)=> (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) x1))))) (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X))))) (fun (x:(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))=> ((x (eq fofType)) (eq_ref fofType)))))
% 1.11/1.25  Time elapsed = 0.640128s
% 1.11/1.25  node=134 cost=3312.000000 depth=14
% 1.11/1.25  ::::::::::::::::::::::
% 1.11/1.25  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.11/1.25  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.11/1.25  (fun (X:fofType) (Y:fofType)=> ((((conj ((((eq fofType) X) Y)->(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))) ((forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y)))->(((eq fofType) X) Y))) (fun (x:(((eq fofType) X) Y))=> ((x (fun (x1:fofType)=> (forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) x1))))) (fun (R:(fofType->(fofType->Prop))) (x00:(forall (Z:fofType), ((R Z) Z)))=> (x00 X))))) (fun (x:(forall (R:(fofType->(fofType->Prop))), ((forall (Z:fofType), ((R Z) Z))->((R X) Y))))=> ((x (eq fofType)) (eq_ref fofType)))))
% 1.11/1.25  % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
%------------------------------------------------------------------------------