TSTP Solution File: KRS267+1 by Fampire---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Fampire---1.3
% Problem : KRS267+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp
% Command : FlotterOnTPTP.pl -f oldtptp -s vampire -t %d %s
% Computer : n027.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 : 600s
% DateTime : Sun Jul 17 03:01:40 EDT 2022
% Result : Unknown 0.20s 0.46s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : KRS267+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.13 % Command : FlotterOnTPTP.pl -f oldtptp -s vampire -t %d %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 7 09:06:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 cs: Command not found.
% 0.20/0.46
% 0.20/0.46 ERROR: Cannot translate to DFG with tptp4X
% 0.20/0.46 %------------------------------------------------------------------------------
% 0.20/0.46 % File : KRS267+1 : TPTP v8.0.0. Bugfixed v5.4.0.
% 0.20/0.46 % Domain : Knowledge Representation
% 0.20/0.46 % Problem : TCA mighta THM
% 0.20/0.46 % Version : [Sut08] axioms.
% 0.20/0.46 % English :
% 0.20/0.46
% 0.20/0.46 % Refs : [Sut08] Sutcliffe (2008), The SZS Ontologies for Automated Rea
% 0.20/0.46 % Source : [TPTP]
% 0.20/0.46 % Names :
% 0.20/0.46
% 0.20/0.46 % Status : Theorem
% 0.20/0.46 % Rating : 0.21 v7.5.0, 0.24 v7.4.0, 0.19 v7.3.0, 0.29 v7.2.0, 0.17 v7.1.0, 0.25 v7.0.0, 0.07 v6.4.0, 0.14 v6.3.0, 0.23 v6.2.0, 0.36 v6.1.0, 0.28 v6.0.0, 0.50 v5.5.0, 0.42 v5.4.0
% 0.20/0.46 % Syntax : Number of formulae : 33 ( 3 unt; 0 def)
% 0.20/0.46 % Number of atoms : 107 ( 0 equ)
% 0.20/0.46 % Maximal formula atoms : 7 ( 3 avg)
% 0.20/0.46 % Number of connectives : 96 ( 22 ~; 1 |; 35 &)
% 0.20/0.46 % ( 28 <=>; 8 =>; 0 <=; 2 <~>)
% 0.20/0.46 % Maximal formula depth : 10 ( 6 avg)
% 0.20/0.46 % Maximal term depth : 2 ( 1 avg)
% 0.20/0.46 % Number of predicates : 7 ( 7 usr; 0 prp; 2-3 aty)
% 0.20/0.46 % Number of functors : 20 ( 20 usr; 19 con; 0-1 aty)
% 0.20/0.46 % Number of variables : 122 ( 72 !; 50 ?)
% 0.20/0.46 % SPC : FOF_THM_RFO_NEQ
% 0.20/0.46
% 0.20/0.46 % Comments :
% 0.20/0.46 % Bugfixes : v5.4.0 - Added missing axiom in KRS001+1.ax
% 0.20/0.46 %------------------------------------------------------------------------------
% 0.20/0.46 %----Include SZS success ontology nodes
% 0.20/0.46 %------------------------------------------------------------------------------
% 0.20/0.46 begin_problem(SomeProblem).
% 0.20/0.46 list_of_descriptions.
% 0.20/0.46 name({* BLAH *}).
% 0.20/0.46 author({* BLAH *}).
% 0.20/0.46 status(unknown).
% 0.20/0.46 description({* BLAH *}).
% 0.20/0.46 end_of_list.
% 0.20/0.46 list_of_symbols.
% 0.20/0.46 functions[(cax__dfg,0),(csa__dfg,0),(eqv__dfg,0),(esa__dfg,0),(eth__dfg,0),(noc__dfg,0),(not__dfg,1),(sap__dfg,0),(sat__dfg,0),(sca__dfg,0),(tac__dfg,0),(tau__dfg,0),(tca__dfg,0),(thm__dfg,0),(unp__dfg,0),(uns__dfg,0),(wca__dfg,0),(wec__dfg,0),(wtc__dfg,0),(wth__dfg,0)].
% 0.20/0.46 predicates[(isa__dfg,2),(mighta__dfg,2),(model__dfg,2),(nevera__dfg,2),(nota__dfg,2),(status__dfg,3),(xora__dfg,2)].
% 0.20/0.46 end_of_list.
% 0.20/0.46
% 0.20/0.46 list_of_formulae(axioms).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 implies(
% 0.20/0.46 not(
% 0.20/0.46 exists([I1],
% 0.20/0.46 model__dfg(I1,Ax))),
% 0.20/0.46 not(
% 0.20/0.46 exists([I2],
% 0.20/0.46 model__dfg(I2,C)))),
% 0.20/0.46 status__dfg(Ax,C,unp__dfg))),
% 0.20/0.46 unp).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 implies(
% 0.20/0.46 exists([I1],
% 0.20/0.46 model__dfg(I1,Ax)),
% 0.20/0.46 exists([I2],
% 0.20/0.46 model__dfg(I2,C))),
% 0.20/0.46 status__dfg(Ax,C,sap__dfg))),
% 0.20/0.46 sap).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 equiv(
% 0.20/0.46 exists([I1],
% 0.20/0.46 model__dfg(I1,Ax)),
% 0.20/0.46 exists([I2],
% 0.20/0.46 model__dfg(I2,C))),
% 0.20/0.46 status__dfg(Ax,C,esa__dfg))),
% 0.20/0.46 esa).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 exists([I1],
% 0.20/0.46 and(
% 0.20/0.46 model__dfg(I1,Ax),
% 0.20/0.46 model__dfg(I1,C))),
% 0.20/0.46 status__dfg(Ax,C,sat__dfg))),
% 0.20/0.46 sat).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 forall([I1],
% 0.20/0.46 implies(
% 0.20/0.46 model__dfg(I1,Ax),
% 0.20/0.46 model__dfg(I1,C))),
% 0.20/0.46 status__dfg(Ax,C,thm__dfg))),
% 0.20/0.46 thm).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 and(
% 0.20/0.46 exists([I1],
% 0.20/0.46 model__dfg(I1,Ax)),
% 0.20/0.46 forall([I2],
% 0.20/0.46 equiv(
% 0.20/0.46 model__dfg(I2,Ax),
% 0.20/0.46 model__dfg(I2,C)))),
% 0.20/0.46 status__dfg(Ax,C,eqv__dfg))),
% 0.20/0.46 eqv).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 and(
% 0.20/0.46 exists([I1],
% 0.20/0.46 model__dfg(I1,Ax)),
% 0.20/0.46 forall([I2],
% 0.20/0.46 model__dfg(I2,C))),
% 0.20/0.46 status__dfg(Ax,C,tac__dfg))),
% 0.20/0.46 tac).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 and(
% 0.20/0.46 exists([I1],
% 0.20/0.46 model__dfg(I1,Ax)),
% 0.20/0.46 and(
% 0.20/0.46 forall([I2],
% 0.20/0.46 implies(
% 0.20/0.46 model__dfg(I2,Ax),
% 0.20/0.46 model__dfg(I2,C))),
% 0.20/0.46 exists([I3],
% 0.20/0.46 and(
% 0.20/0.46 model__dfg(I3,C),
% 0.20/0.46 not(
% 0.20/0.46 model__dfg(I3,Ax)))))),
% 0.20/0.46 status__dfg(Ax,C,wec__dfg))),
% 0.20/0.46 wec).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 and(
% 0.20/0.46 exists([I1],
% 0.20/0.46 model__dfg(I1,Ax)),
% 0.20/0.46 and(
% 0.20/0.46 exists([I2],
% 0.20/0.46 not(
% 0.20/0.46 model__dfg(I2,Ax))),
% 0.20/0.46 forall([I3],
% 0.20/0.46 equiv(
% 0.20/0.46 model__dfg(I3,Ax),
% 0.20/0.46 model__dfg(I3,C))))),
% 0.20/0.46 status__dfg(Ax,C,eth__dfg))),
% 0.20/0.46 eth).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 forall([I1],
% 0.20/0.46 and(
% 0.20/0.46 model__dfg(I1,Ax),
% 0.20/0.46 model__dfg(I1,C))),
% 0.20/0.46 status__dfg(Ax,C,tau__dfg))),
% 0.20/0.46 tau).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 and(
% 0.20/0.46 exists([I1],
% 0.20/0.46 model__dfg(I1,Ax)),
% 0.20/0.46 and(
% 0.20/0.46 exists([I2],
% 0.20/0.46 not(
% 0.20/0.46 model__dfg(I2,Ax))),
% 0.20/0.46 forall([I3],
% 0.20/0.46 model__dfg(I3,C)))),
% 0.20/0.46 status__dfg(Ax,C,wtc__dfg))),
% 0.20/0.46 wtc).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 and(
% 0.20/0.46 exists([I1],
% 0.20/0.46 model__dfg(I1,Ax)),
% 0.20/0.46 and(
% 0.20/0.46 forall([I2],
% 0.20/0.46 implies(
% 0.20/0.46 model__dfg(I2,Ax),
% 0.20/0.46 model__dfg(I2,C))),
% 0.20/0.46 and(
% 0.20/0.46 exists([I3],
% 0.20/0.46 and(
% 0.20/0.46 model__dfg(I3,C),
% 0.20/0.46 not(
% 0.20/0.46 model__dfg(I3,Ax)))),
% 0.20/0.46 exists([I4],
% 0.20/0.46 not(
% 0.20/0.46 model__dfg(I4,C)))))),
% 0.20/0.46 status__dfg(Ax,C,wth__dfg))),
% 0.20/0.46 wth).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 not(
% 0.20/0.46 exists([I1],
% 0.20/0.46 model__dfg(I1,Ax))),
% 0.20/0.46 status__dfg(Ax,C,cax__dfg))),
% 0.20/0.46 cax).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 and(
% 0.20/0.46 not(
% 0.20/0.46 exists([I1],
% 0.20/0.46 model__dfg(I1,Ax))),
% 0.20/0.46 exists([I2],
% 0.20/0.46 model__dfg(I2,C))),
% 0.20/0.46 status__dfg(Ax,C,sca__dfg))),
% 0.20/0.46 sca).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 and(
% 0.20/0.46 not(
% 0.20/0.46 exists([I1],
% 0.20/0.46 model__dfg(I1,Ax))),
% 0.20/0.46 forall([I2],
% 0.20/0.46 model__dfg(I2,C))),
% 0.20/0.46 status__dfg(Ax,C,tca__dfg))),
% 0.20/0.46 tca).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 and(
% 0.20/0.46 not(
% 0.20/0.46 exists([I1],
% 0.20/0.46 model__dfg(I1,Ax))),
% 0.20/0.46 and(
% 0.20/0.46 exists([I2],
% 0.20/0.46 model__dfg(I2,C)),
% 0.20/0.46 exists([I3],
% 0.20/0.46 not(
% 0.20/0.46 model__dfg(I3,C))))),
% 0.20/0.46 status__dfg(Ax,C,wca__dfg))),
% 0.20/0.46 wca).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 exists([I1],
% 0.20/0.46 and(
% 0.20/0.46 model__dfg(I1,Ax),
% 0.20/0.46 model__dfg(I1,not__dfg(C)))),
% 0.20/0.46 status__dfg(Ax,C,csa__dfg))),
% 0.20/0.46 csa).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 and(
% 0.20/0.46 forall([I1],
% 0.20/0.46 model__dfg(I1,Ax)),
% 0.20/0.46 forall([I2],
% 0.20/0.46 model__dfg(I2,not__dfg(C)))),
% 0.20/0.46 status__dfg(Ax,C,uns__dfg))),
% 0.20/0.46 uns).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 equiv(
% 0.20/0.46 and(
% 0.20/0.46 exists([I1],
% 0.20/0.46 and(
% 0.20/0.46 model__dfg(I1,Ax),
% 0.20/0.46 model__dfg(I1,C))),
% 0.20/0.46 exists([I2],
% 0.20/0.46 and(
% 0.20/0.46 model__dfg(I2,Ax),
% 0.20/0.46 model__dfg(I2,not__dfg(C))))),
% 0.20/0.46 status__dfg(Ax,C,noc__dfg))),
% 0.20/0.46 noc).
% 0.20/0.46
% 0.20/0.46 %----Include SZS success ontology node relationships
% 0.20/0.46 formula(
% 0.20/0.46 forall([S1,S2],
% 0.20/0.46 equiv(
% 0.20/0.46 exists([Ax,C],
% 0.20/0.46 and(
% 0.20/0.46 status__dfg(Ax,C,S1),
% 0.20/0.46 status__dfg(Ax,C,S2))),
% 0.20/0.46 mighta__dfg(S1,S2))),
% 0.20/0.46 mighta).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([S1,S2],
% 0.20/0.46 equiv(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 implies(
% 0.20/0.46 status__dfg(Ax,C,S1),
% 0.20/0.46 status__dfg(Ax,C,S2))),
% 0.20/0.46 isa__dfg(S1,S2))),
% 0.20/0.46 isa).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([S1,S2],
% 0.20/0.46 equiv(
% 0.20/0.46 exists([Ax,C],
% 0.20/0.46 and(
% 0.20/0.46 status__dfg(Ax,C,S1),
% 0.20/0.46 not(
% 0.20/0.46 status__dfg(Ax,C,S2)))),
% 0.20/0.46 nota__dfg(S1,S2))),
% 0.20/0.46 nota).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([S1,S2],
% 0.20/0.46 equiv(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 implies(
% 0.20/0.46 status__dfg(Ax,C,S1),
% 0.20/0.46 not(
% 0.20/0.46 status__dfg(Ax,C,S2)))),
% 0.20/0.46 nevera__dfg(S1,S2))),
% 0.20/0.46 nevera).
% 0.20/0.46
% 0.20/0.46 formula(
% 0.20/0.46 forall([S1,S2],
% 0.20/0.46 equiv(
% 0.20/0.46 forall([Ax,C],
% 0.20/0.46 ERROR: (JJ misuse): Not a DFG connective
%------------------------------------------------------------------------------