↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : LCL512+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 : n006.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:56 PM UTC 2026

% Result   : Theorem 1.96s 0.60s
% Output   : CNFRefutation 1.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   20 (  11 unt;   0 def)
%            Number of atoms       :   29 (   3 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   18 (   9   ~;   6   |;   0   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   10 (   1 sgn   6   !;   0   ?)

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

fof(hilbert_equivalence_1_negated,plain,
    ~ equivalence_1,
    inference(negate_conjecture,[status(cth)],[hilbert_equivalence_1]) ).

cnf(71,plain,
    ~ equivalence_1,
    inference(cnf,[status(esa)],[hilbert_equivalence_1_negated]) ).

cnf(l0,plain,
    ~ equivalence_1,
    inference(instantiation,[status(thm)],[71]) ).

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

cnf(28,plain,
    ( ~ is_a_theorem(implies(equiv(sK27,sK28),implies(sK27,sK28)))
    | equivalence_1 ),
    inference(cnf,[status(esa)],[equivalence_1]) ).

cnf(l1,plain,
    ( ~ is_a_theorem(implies(equiv(sK27,sK28),implies(sK27,sK28)))
    | equivalence_1 ),
    inference(instantiation,[status(thm)],[28]) ).

fof(op_equiv,plain,
    ( op_equiv
   => ! [X,Y] : equiv(X,Y) = and(implies(X,Y),implies(Y,X)) ),
    file('Axioms/LCL006+1.ax',op_equiv) ).

cnf(59,plain,
    ( ~ op_equiv
    | equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
    inference(cnf,[status(esa)],[op_equiv]) ).

cnf(l93,plain,
    ( ~ op_equiv
    | equiv(sK27,sK28) = and(implies(sK27,sK28),implies(sK28,sK27)) ),
    inference(instantiation,[status(thm)],[59]) ).

fof(hilbert_op_equiv,plain,
    op_equiv,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_equiv) ).

cnf(70,plain,
    op_equiv,
    inference(cnf,[status(esa)],[hilbert_op_equiv]) ).

cnf(l96,plain,
    op_equiv,
    inference(instantiation,[status(thm)],[70]) ).

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

cnf(35,plain,
    ( ~ kn2
    | is_a_theorem(implies(and(X0,X1),X0)) ),
    inference(cnf,[status(esa)],[kn2]) ).

cnf(l7,plain,
    ( ~ kn2
    | is_a_theorem(implies(and(implies(sK27,sK28),implies(sK28,sK27)),implies(sK27,sK28))) ),
    inference(instantiation,[status(thm)],[35]) ).

fof(rosser_kn2,plain,
    kn2,
    file('Axioms/LCL006+5.ax',rosser_kn2) ).

cnf(65,plain,
    kn2,
    inference(cnf,[status(esa)],[rosser_kn2]) ).

cnf(l11,plain,
    kn2,
    inference(instantiation,[status(thm)],[65]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL512+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.07/0.34  % Computer : n006.cluster.edu
% 0.07/0.34  % Model    : x86_64 x86_64
% 0.07/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34  % Memory   : 8046.5625MB
% 0.07/0.34  % OS       : Linux 6.8.0-71-generic
% 0.07/0.34  % CPULimit : 300
% 0.07/0.34  % WCLimit  : 300
% 0.07/0.34  % DateTime : Sat Sep  5 17:13:46 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  % launching worker at depth: 1
% 0.07/0.35  % launching worker at depth: 7
% 0.07/0.35  % launching worker at depth: 2
% 0.07/0.35  % launching worker at depth: 4
% 0.07/0.35  % launching worker at depth: 5
% 0.07/0.35  % launching worker at depth: 6
% 0.07/0.35  % launching worker at depth: 8
% 0.07/0.35  % launching worker at depth: 3
% 0.07/0.35  % launching worker at depth: 9
% 0.07/0.35  % launching worker at depth: 10
% 0.07/0.36  % launching worker at depth: 11
% 0.12/0.40  % launching worker at depth: 12
% 1.96/0.60  % SZS status Theorem for theBenchmark
% 1.96/0.60  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------