↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : KLE076+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n019.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 : Fri Sep 25 01:51:33 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    domain(zero) = zero,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain4) ).

fof(f15_nnf,plain,
    domain(zero) = zero,
    inference(nnf_transformation,[status(thm)],[f15]) ).

cnf(c16,plain,
    domain(zero) = zero,
    inference(cnf_transformation,[status(esa)],[f15_nnf]) ).

cnf(t0,plain,
    domain(zero) = zero,
    inference(equality_encoding,[status(esa)],[c16]) ).

cnf(t74,plain,
    domain(zero) = zero,
    inference(orient,[status(thm)],[t0]) ).

fof(f9,axiom,
    ! [A] : multiplication(A,zero) = zero,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_annihilation) ).

fof(f9_nnf,plain,
    ! [A] : multiplication(A,zero) = zero,
    inference(nnf_transformation,[status(thm)],[f9]) ).

fof(f9_sk,plain,
    ! [A] : multiplication(A,zero) = zero,
    inference(skolemisation,[status(esa)],[f9_nnf]) ).

cnf(c9,plain,
    multiplication(X0,zero) = zero,
    inference(cnf_transformation,[status(esa)],[f9_sk]) ).

cnf(t7,plain,
    multiplication(X1,zero) = zero,
    inference(equality_encoding,[status(esa)],[c9]) ).

cnf(t69,plain,
    multiplication(X1,zero) = zero,
    inference(orient,[status(thm)],[t7]) ).

fof(f17,conjecture,
    ! [X0] : domain(multiplication(X0,domain(zero))) = zero,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(f17_neg,negated_conjecture,
    ~ ! [X0] : domain(multiplication(X0,domain(zero))) = zero,
    inference(negated_conjecture,[status(cth)],[f17]) ).

fof(f17_nnf,plain,
    ? [X0] : domain(multiplication(X0,domain(zero))) != zero,
    inference(nnf_transformation,[status(thm)],[f17_neg]) ).

fof(f17_sk,plain,
    domain(multiplication(sk0,domain(zero))) != zero,
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f17_nnf]) ).

cnf(c18,plain,
    domain(multiplication(sk0,domain(zero))) != zero,
    inference(cnf_transformation,[status(esa)],[f17_sk]) ).

cnf(goal_0,negated_conjecture,
    domain(multiplication(sk0,domain(zero))) != zero,
    inference(equality_encoding,[status(esa)],[c18]) ).

cnf(g0_0,plain,
    domain(multiplication(sk0,zero)) != zero,
    inference(rw,[status(thm)],[goal_0,t74]) ).

cnf(g0_1,plain,
    domain(zero) != zero,
    inference(rw,[status(thm)],[g0_0,t69]) ).

cnf(g0_2,plain,
    zero != zero,
    inference(rw,[status(thm)],[g0_1,t74]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE076+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36  % Computer : n019.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Wed Sep 23 18:51:34 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.98/0.87  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.98/0.87  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------