↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : KLE075+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n026.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 : Sun Sep 27 07:44:15 AM UTC 2026

% Result   : Theorem 0.08s 0.39s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (  13 unt;   0 def)
%            Number of atoms       :   13 (  12 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   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   :   11 (   0 sgn   5   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(multiplicative_left_identity,axiom,
    ! [A] : multiplication(one,A) = A,
    file('theBenchmark.p',multiplicative_left_identity) ).

fof(domain2,axiom,
    ! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
    file('theBenchmark.p',domain2) ).

fof(goals,conjecture,
    ! [X0] : domain(multiplication(one,domain(X0))) = domain(X0),
    file('theBenchmark.p',goals) ).

fof(goals_neg,negated_conjecture,
    ~ ! [X0] : domain(multiplication(one,domain(X0))) = domain(X0),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(nnf_17,plain,
    ? [X0] : domain(multiplication(one,domain(X0))) != domain(X0),
    inference(fof_nnf,[status(thm)],[goals_neg]) ).

fof(sk_goals_neg,plain,
    domain(multiplication(one,domain(sK0))) != domain(sK0),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[nnf_17]) ).

cnf(c_20,negated_conjecture,
    domain(multiplication(one,domain(sK0))) != domain(sK0),
    inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).

cnf(c_24,plain,
    domain(multiplication(A,domain(B))) = domain(multiplication(A,B)),
    inference(clausify,[status(thm)],[domain2]) ).

cnf(c_33,plain,
    multiplication(one,A) = A,
    inference(clausify,[status(thm)],[multiplicative_left_identity]) ).

cnf(c_40,negated_conjecture,
    domain(domain(sK0)) != domain(sK0),
    inference(paramod,[status(thm)],[c_33,c_20]) ).

cnf(c_57,plain,
    domain(domain(A)) = domain(multiplication(one,A)),
    inference(paramod,[status(thm)],[c_33,c_24]) ).

cnf(c_55,plain,
    domain(domain(A)) = domain(A),
    inference(paramod,[status(thm)],[c_33,c_57]) ).

cnf(c_56,plain,
    $false,
    inference(resolve,[status(thm)],[c_55,c_40]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE075+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n026.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Fri Sep 25 19:22:39 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36  % Process 3219023 was started by sandbox2 on n026,
% 0.08/0.36  % Fri Sep 25 19:22:39 2026
% 0.08/0.36  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.37  
% 0.08/0.37  % From the command line: assign(max_seconds, 300).
% 0.08/0.39  
% 0.08/0.39  % SZS status Theorem for theBenchmark
% 0.08/0.39  
% 0.08/0.39  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.08/0.39  % Length of proof is 9.
% 0.08/0.39  % Level of proof is 3.
% 0.08/0.39  % Maximum clause weight is 10.000.
% 0.08/0.39  % Given clauses 9.
% 0.08/0.39  
% 0.08/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------