↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : LCL484+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 12:13:54 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(hilbert_implies_1,plain,
    implies_1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_1) ).

fof(hilbert_implies_1_negated,plain,
    ~ implies_1,
    inference(negate_conjecture,[status(cth)],[hilbert_implies_1]) ).

cnf(73,plain,
    ~ implies_1,
    inference(cnf,[status(esa)],[hilbert_implies_1_negated]) ).

cnf(l0,plain,
    ~ implies_1,
    inference(instantiation,[status(thm)],[73]) ).

fof(implies_1,plain,
    ( implies_1
  <=> ! [X,Y] : is_a_theorem(implies(X,implies(Y,X))) ),
    file('Axioms/LCL006+0.ax',implies_1) ).

cnf(10,plain,
    ( ~ is_a_theorem(implies(sK7,implies(sK8,sK7)))
    | implies_1 ),
    inference(cnf,[status(esa)],[implies_1]) ).

cnf(l1,plain,
    ( ~ is_a_theorem(implies(sK7,implies(sK8,sK7)))
    | implies_1 ),
    inference(instantiation,[status(thm)],[10]) ).

fof(op_implies_or,plain,
    ( op_implies_or
   => ! [X,Y] : implies(X,Y) = or(not(X),Y) ),
    file('Axioms/LCL006+1.ax',op_implies_or) ).

cnf(58,plain,
    ( ~ op_implies_or
    | implies(X0,X1) = or(not(X0),X1) ),
    inference(cnf,[status(esa)],[op_implies_or]) ).

cnf(l96,plain,
    ( ~ op_implies_or
    | implies(sK8,sK7) = or(not(sK8),sK7) ),
    inference(instantiation,[status(thm)],[58]) ).

fof(principia_op_implies_or,plain,
    op_implies_or,
    file('Axioms/LCL006+4.ax',principia_op_implies_or) ).

cnf(60,plain,
    op_implies_or,
    inference(cnf,[status(esa)],[principia_op_implies_or]) ).

cnf(l97,plain,
    op_implies_or,
    inference(instantiation,[status(thm)],[60]) ).

fof(or_2,plain,
    ( or_2
  <=> ! [X,Y] : is_a_theorem(implies(Y,or(X,Y))) ),
    file('Axioms/LCL006+0.ax',or_2) ).

cnf(23,plain,
    ( ~ or_2
    | is_a_theorem(implies(X0,or(X1,X0))) ),
    inference(cnf,[status(esa)],[or_2]) ).

cnf(l7,plain,
    ( ~ or_2
    | is_a_theorem(implies(sK7,or(not(sK8),sK7))) ),
    inference(instantiation,[status(thm)],[23]) ).

cnf(24,plain,
    ( ~ is_a_theorem(implies(sK23,or(sK22,sK23)))
    | or_2 ),
    inference(cnf,[status(esa)],[or_2]) ).

cnf(l11,plain,
    ( ~ is_a_theorem(implies(sK23,or(sK22,sK23)))
    | or_2 ),
    inference(instantiation,[status(thm)],[24]) ).

fof(r2,plain,
    ( r2
  <=> ! [P,Q] : is_a_theorem(implies(Q,or(P,Q))) ),
    file('Axioms/LCL006+0.ax',r2) ).

cnf(47,plain,
    ( ~ r2
    | is_a_theorem(implies(X0,or(X1,X0))) ),
    inference(cnf,[status(esa)],[r2]) ).

cnf(l16,plain,
    ( ~ r2
    | is_a_theorem(implies(sK23,or(sK22,sK23))) ),
    inference(instantiation,[status(thm)],[47]) ).

fof(principia_r2,plain,
    r2,
    file('Axioms/LCL006+4.ax',principia_r2) ).

cnf(65,plain,
    r2,
    inference(cnf,[status(esa)],[principia_r2]) ).

cnf(l81,plain,
    r2,
    inference(instantiation,[status(thm)],[65]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l96,l97,l7,l11,l16,l81]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL484+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n007.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep  5 09:41:39 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % launching worker at depth: 1
% 0.09/0.37  % launching worker at depth: 2
% 0.09/0.37  % launching worker at depth: 4
% 0.09/0.37  % launching worker at depth: 3
% 0.09/0.37  % launching worker at depth: 5
% 0.09/0.37  % launching worker at depth: 6
% 0.09/0.37  % launching worker at depth: 7
% 0.09/0.37  % launching worker at depth: 8
% 0.09/0.37  % launching worker at depth: 9
% 0.09/0.37  % launching worker at depth: 10
% 0.09/0.37  % launching worker at depth: 11
% 0.09/0.41  % launching worker at depth: 12
% 3.48/0.84  % SZS status Theorem for theBenchmark
% 3.48/0.84  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------