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