TSTP Solution File: SYN000+1 by Fampire---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Fampire---1.3
% Problem : SYN000+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : FlotterOnTPTP.pl -f oldtptp -s vampire -t %d %s
% Computer : n014.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 : Thu Jul 21 06:15:26 EDT 2022
% Result : Unknown 0.18s 0.46s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN000+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : FlotterOnTPTP.pl -f oldtptp -s vampire -t %d %s
% 0.13/0.34 % Computer : n014.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.34 % DateTime : Tue Jul 12 04:56:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 cs: Command not found.
% 0.18/0.45
% 0.18/0.45 ERROR: Cannot translate to DFG with tptp4X
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 % File : SYN000+1 : TPTP v8.0.0. Released v4.0.0.
% 0.18/0.45 % Domain : Syntactic
% 0.18/0.45 % Problem : Basic TPTP FOF syntax
% 0.18/0.45 % Version : Biased.
% 0.18/0.45 % English : Basic TPTP FOF syntax that you can't survive without parsing.
% 0.18/0.45
% 0.18/0.45 % Refs :
% 0.18/0.45 % Source : [TPTP]
% 0.18/0.45 % Names :
% 0.18/0.45
% 0.18/0.45 % Status : Theorem
% 0.18/0.45 % Rating : 0.19 v7.4.0, 0.17 v7.0.0, 0.20 v6.4.0, 0.19 v6.3.0, 0.25 v6.2.0, 0.28 v6.1.0, 0.33 v6.0.0, 0.43 v5.5.0, 0.48 v5.4.0, 0.46 v5.3.0, 0.52 v5.2.0, 0.40 v5.1.0, 0.43 v5.0.0, 0.54 v4.1.0, 0.57 v4.0.1, 0.78 v4.0.0
% 0.18/0.45 % Syntax : Number of formulae : 12 ( 5 unt; 0 def)
% 0.18/0.45 % Number of atoms : 31 ( 3 equ)
% 0.18/0.45 % Maximal formula atoms : 5 ( 2 avg)
% 0.18/0.45 % Number of connectives : 28 ( 9 ~; 10 |; 3 &)
% 0.18/0.45 % ( 1 <=>; 3 =>; 1 <=; 1 <~>)
% 0.18/0.45 % Maximal formula depth : 7 ( 4 avg)
% 0.18/0.45 % Maximal term depth : 4 ( 2 avg)
% 0.18/0.45 % Number of predicates : 16 ( 13 usr; 10 prp; 0-3 aty)
% 0.18/0.45 % Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% 0.18/0.45 % Number of variables : 13 ( 5 !; 8 ?)
% 0.18/0.45 % SPC : FOF_THM_RFO_SEQ
% 0.18/0.45
% 0.18/0.45 % Comments :
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 %----Propositional
% 0.18/0.45 begin_problem(SomeProblem).
% 0.18/0.45 list_of_descriptions.
% 0.18/0.45 name({* BLAH *}).
% 0.18/0.45 author({* BLAH *}).
% 0.18/0.45 status(unknown).
% 0.18/0.45 description({* BLAH *}).
% 0.18/0.45 end_of_list.
% 0.18/0.45 list_of_symbols.
% 0.18/0.45 functions[('A \'quoted \\ escape\'__dfg',0),('A constant__dfg',0),('A function__dfg',1),(a__dfg,0),(b__dfg,0),(f__dfg,1),(g__dfg,3),(h__dfg,0)].
% 0.18/0.45 predicates[('A predicate__dfg',1),('A proposition__dfg',0),(ia1__dfg,0),(ia2__dfg,0),(ia3__dfg,0),(p__dfg,1),(p0__dfg,0),(q__dfg,2),(q0__dfg,0),(r__dfg,3),(r0__dfg,0),(s__dfg,1),(s0__dfg,0)].
% 0.18/0.45 end_of_list.
% 0.18/0.45
% 0.18/0.45 list_of_formulae(axioms).
% 0.18/0.45
% 0.18/0.45 formula(
% 0.18/0.45 implies(
% 0.18/0.45 and(
% 0.18/0.45 p0__dfg,
% 0.18/0.45 not(
% 0.18/0.45 q0__dfg)),
% 0.18/0.45 or(
% 0.18/0.45 r0__dfg,
% 0.18/0.45 not(
% 0.18/0.45 s0__dfg))),
% 0.18/0.45 propositional).
% 0.18/0.45
% 0.18/0.45 %----First-order
% 0.18/0.45 formula(
% 0.18/0.45 forall([X],
% 0.18/0.45 implies(
% 0.18/0.45 or(
% 0.18/0.45 p__dfg(X),
% 0.18/0.45 not(
% 0.18/0.45 q__dfg(X,a__dfg))),
% 0.18/0.45 exists([Y,Z],
% 0.18/0.45 and(
% 0.18/0.45 r__dfg(X,f__dfg(Y),g__dfg(X,f__dfg(Y),Z)),
% 0.18/0.45 not(
% 0.18/0.45 s__dfg(f__dfg(f__dfg(f__dfg(b__dfg))))))))),
% 0.18/0.45 first_order).
% 0.18/0.45
% 0.18/0.45 %----Equality
% 0.18/0.45 formula(
% 0.18/0.45 exists([Y],
% 0.18/0.45 forall([X,Z],
% 0.18/0.45 or(
% 0.18/0.45 equal(f__dfg(Y),g__dfg(X,f__dfg(Y),Z)),
% 0.18/0.45 or(
% 0.18/0.45 not(
% 0.18/0.45 equal(f__dfg(f__dfg(f__dfg(b__dfg))),a__dfg)),
% 0.18/0.45 equal(X,f__dfg(Y)))))),
% 0.18/0.45 equality).
% 0.18/0.45
% 0.18/0.45 %----True and false
% 0.18/0.45 formula(
% 0.18/0.45 or(
% 0.18/0.45 true,
% 0.18/0.45 false),
% 0.18/0.45 true_false).
% 0.18/0.45
% 0.18/0.45 %----Quoted symbols
% 0.18/0.45 formula(
% 0.18/0.45 or(
% 0.18/0.45 'A proposition__dfg',
% 0.18/0.45 or(
% 0.18/0.45 'A predicate__dfg'(a__dfg),
% 0.18/0.45 or(
% 0.18/0.45 p__dfg('A constant__dfg'),
% 0.18/0.45 or(
% 0.18/0.45 p__dfg('A function__dfg'(a__dfg)),
% 0.18/0.45 p__dfg('A \'quoted \\ escape\'__dfg'))))),
% 0.18/0.45 single_quoted).
% 0.18/0.45
% 0.18/0.45 %----Connectives - seen |, &, =>, ~ already
% 0.18/0.45 formula(
% 0.18/0.45 forall([X],
% 0.18/0.45 equiv(
% 0.18/0.45 implied(
% 0.18/0.45 p__dfg(X),
% 0.18/0.45 not(
% 0.18/0.45 q__dfg(X,a__dfg))),
% 0.18/0.45 exists([Y,Z],
% 0.18/0.45 ERROR: (JJ misuse): Not a DFG connective
%------------------------------------------------------------------------------