↑ Up

PyRes---1.5.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : SWV367+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n004.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  : 300s
% DateTime : Thu May  9 17:44:51 EDT 2024

% Result   : Theorem 11.15s 11.36s
% Output   : Refutation 11.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   19 (  11 unt;   0 def)
%            Number of atoms       :   30 (  14 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   25 (  14   ~;   6   |;   3   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-3 aty)
%            Number of variables   :   30 (   3 sgn  13   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax8,axiom,
    ! [U] : ~ contains_pq(create_pq,U),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+1.ax',ax8) ).

fof(c274,plain,
    ! [U] : ~ contains_pq(create_pq,U),
    inference(fof_simplification,[status(thm)],[ax8]) ).

fof(c275,plain,
    ! [X185] : ~ contains_pq(create_pq,X185),
    inference(variable_rename,[status(thm)],[c274]) ).

cnf(c276,plain,
    ~ contains_pq(create_pq,X206),
    inference(split_conjunct,[status(thm)],[c275]) ).

cnf(reflexivity,axiom,
    X199 = X199,
    theory(equality) ).

fof(ax54,axiom,
    ! [U,V] : i(triple(U,create_slb,V)) = create_pq,
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax54) ).

fof(c101,plain,
    ! [X38,X39] : i(triple(X38,create_slb,X39)) = create_pq,
    inference(variable_rename,[status(thm)],[ax54]) ).

cnf(c102,plain,
    i(triple(X625,create_slb,X626)) = create_pq,
    inference(split_conjunct,[status(thm)],[c101]) ).

cnf(c25,axiom,
    ( X494 != X496
    | X497 != X495
    | ~ contains_pq(X494,X497)
    | contains_pq(X496,X495) ),
    theory(equality) ).

fof(l3_co,conjecture,
    ! [U,V,W] :
      ( contains_pq(i(triple(U,create_slb,V)),W)
     => i(remove_cpq(triple(U,create_slb,V),W)) = remove_pq(i(triple(U,create_slb,V)),W) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_co) ).

fof(c41,negated_conjecture,
    ~ ! [U,V,W] :
        ( contains_pq(i(triple(U,create_slb,V)),W)
       => i(remove_cpq(triple(U,create_slb,V),W)) = remove_pq(i(triple(U,create_slb,V)),W) ),
    inference(assume_negation,[status(cth)],[l3_co]) ).

fof(c42,negated_conjecture,
    ? [U,V,W] :
      ( contains_pq(i(triple(U,create_slb,V)),W)
      & i(remove_cpq(triple(U,create_slb,V),W)) != remove_pq(i(triple(U,create_slb,V)),W) ),
    inference(fof_nnf,[status(thm)],[c41]) ).

fof(c43,negated_conjecture,
    ? [X2,X3,X4] :
      ( contains_pq(i(triple(X2,create_slb,X3)),X4)
      & i(remove_cpq(triple(X2,create_slb,X3),X4)) != remove_pq(i(triple(X2,create_slb,X3)),X4) ),
    inference(variable_rename,[status(thm)],[c42]) ).

fof(c44,negated_conjecture,
    ( contains_pq(i(triple(skolem0001,create_slb,skolem0002)),skolem0003)
    & i(remove_cpq(triple(skolem0001,create_slb,skolem0002),skolem0003)) != remove_pq(i(triple(skolem0001,create_slb,skolem0002)),skolem0003) ),
    inference(skolemize,[status(esa)],[c43]) ).

cnf(c45,negated_conjecture,
    contains_pq(i(triple(skolem0001,create_slb,skolem0002)),skolem0003),
    inference(split_conjunct,[status(thm)],[c44]) ).

cnf(c872,plain,
    ( i(triple(skolem0001,create_slb,skolem0002)) != X4143
    | skolem0003 != X4142
    | contains_pq(X4143,X4142) ),
    inference(resolution,[status(thm)],[c45,c25]) ).

cnf(c20666,plain,
    ( skolem0003 != X4144
    | contains_pq(create_pq,X4144) ),
    inference(resolution,[status(thm)],[c872,c102]) ).

cnf(c20669,plain,
    contains_pq(create_pq,skolem0003),
    inference(resolution,[status(thm)],[c20666,reflexivity]) ).

cnf(c20685,plain,
    $false,
    inference(resolution,[status(thm)],[c20669,c276]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SWV367+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.14  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.15/0.36  % Computer : n004.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu May  9 05:52:38 EDT 2024
% 0.15/0.36  % CPUTime  : 
% 11.15/11.36  % Version:  1.5
% 11.15/11.36  % SZS status Theorem
% 11.15/11.36  % SZS output start CNFRefutation
% See solution above
% 11.15/11.36  
% 11.15/11.36  % Initial clauses    : 132
% 11.15/11.36  % Processed clauses  : 1147
% 11.15/11.36  % Factors computed   : 46
% 11.15/11.36  % Resolvents computed: 20345
% 11.15/11.36  % Tautologies deleted: 12
% 11.15/11.36  % Forward subsumed   : 805
% 11.15/11.36  % Backward subsumed  : 5
% 11.15/11.36  % -------- CPU Time ---------
% 11.15/11.36  % User time          : 10.941 s
% 11.15/11.36  % System time        : 0.053 s
% 11.15/11.36  % Total time         : 10.994 s
%------------------------------------------------------------------------------