↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : KLE061+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 : n005.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:14 AM UTC 2026

% Result   : Theorem 0.09s 0.40s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   30 (  30 unt;   0 def)
%            Number of atoms       :   30 (  29 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   39 (   5 sgn  12   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
    ! [A,B] : addition(A,B) = addition(B,A),
    file('theBenchmark.p',additive_commutativity) ).

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

fof(left_distributivity,axiom,
    ! [A,B,C] : multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
    file('theBenchmark.p',left_distributivity) ).

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

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

fof(domain3,axiom,
    ! [X0] : addition(domain(X0),one) = one,
    file('theBenchmark.p',domain3) ).

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

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

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

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

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

cnf(c_21,negated_conjecture,
    multiplication(domain(sK0),domain(sK0)) != domain(sK0),
    inference(copy,[status(thm)],[c_20]) ).

cnf(c_24,plain,
    addition(domain(A),one) = one,
    inference(clausify,[status(thm)],[domain3]) ).

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

cnf(c_26,plain,
    multiplication(domain(A),A) = addition(A,multiplication(domain(A),A)),
    inference(clausify,[status(thm)],[domain1]) ).

cnf(c_27,plain,
    addition(A,multiplication(domain(A),A)) = multiplication(domain(A),A),
    inference(copy,[status(thm)],[c_26]) ).

cnf(c_30,plain,
    multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
    inference(clausify,[status(thm)],[left_distributivity]) ).

cnf(c_31,plain,
    addition(multiplication(A,B),multiplication(C,B)) = multiplication(addition(A,C),B),
    inference(copy,[status(thm)],[c_30]) ).

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

cnf(c_40,plain,
    addition(A,B) = addition(B,A),
    inference(clausify,[status(thm)],[additive_commutativity]) ).

cnf(c_41,plain,
    addition(one,domain(A)) = one,
    inference(paramod,[status(thm)],[c_40,c_24]) ).

cnf(c_91,plain,
    domain(domain(A)) = domain(multiplication(one,A)),
    inference(paramod,[status(thm)],[c_34,c_25]) ).

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

cnf(c_92,plain,
    addition(multiplication(one,A),multiplication(domain(B),A)) = multiplication(one,A),
    inference(paramod,[status(thm)],[c_41,c_31]) ).

cnf(c_93,plain,
    addition(A,multiplication(domain(B),A)) = multiplication(one,A),
    inference(paramod,[status(thm)],[c_34,c_92]) ).

cnf(c_76,plain,
    addition(A,multiplication(domain(B),A)) = A,
    inference(paramod,[status(thm)],[c_34,c_93]) ).

cnf(c_94,plain,
    A = multiplication(domain(A),A),
    inference(paramod,[status(thm)],[c_76,c_27]) ).

cnf(c_79,plain,
    multiplication(domain(A),A) = A,
    inference(copy,[status(thm)],[c_94]) ).

cnf(c_89,plain,
    multiplication(domain(A),domain(A)) = domain(A),
    inference(paramod,[status(thm)],[c_55,c_79]) ).

cnf(c_90,plain,
    $false,
    inference(resolve,[status(thm)],[c_89,c_21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE061+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.09/0.37  % Computer : n005.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Fri Sep 25 19:19:03 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37  % Process 4138025 was started by sandbox2 on n005,
% 0.09/0.37  % Fri Sep 25 19:19:03 2026
% 0.09/0.37  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.38  
% 0.09/0.38  % From the command line: assign(max_seconds, 300).
% 0.09/0.40  
% 0.09/0.40  % SZS status Theorem for theBenchmark
% 0.09/0.40  
% 0.09/0.40  % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.09/0.40  % Length of proof is 23.
% 0.09/0.40  % Level of proof is 6.
% 0.09/0.40  % Maximum clause weight is 13.000.
% 0.09/0.40  % Given clauses 22.
% 0.09/0.40  
% 0.09/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------