↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : FLD030-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n013.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:11:32 AM UTC 2026

% Result   : Unsatisfiable 0.14s 0.38s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   20 (  12 unt;   0 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  18   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   17 (   0 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(symmetry_of_equality,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ equalish(VAR_1,VAR_0)
      | equalish(VAR_0,VAR_1) ),
    file('theBenchmark.p',symmetry_of_equality) ).

cnf(c_22,plain,
    ( ~ equalish(B,A)
    | equalish(A,B) ),
    inference(clausify,[status(thm)],[symmetry_of_equality]) ).

fof(transitivity_of_equality,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ equalish(VAR_2,VAR_1)
      | ~ equalish(VAR_0,VAR_2)
      | equalish(VAR_0,VAR_1) ),
    file('theBenchmark.p',transitivity_of_equality) ).

cnf(c_23,plain,
    ( ~ equalish(C,B)
    | ~ equalish(A,C)
    | equalish(A,B) ),
    inference(clausify,[status(thm)],[transitivity_of_equality]) ).

fof(compatibility_of_equality_and_multiplication,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ equalish(VAR_0,VAR_2)
      | ~ defined(VAR_1)
      | equalish(multiply(VAR_0,VAR_1),multiply(VAR_2,VAR_1)) ),
    file('theBenchmark.p',compatibility_of_equality_and_multiplication) ).

cnf(c_25,plain,
    ( ~ equalish(A,C)
    | ~ defined(B)
    | equalish(multiply(A,B),multiply(C,B)) ),
    inference(clausify,[status(thm)],[compatibility_of_equality_and_multiplication]) ).

fof(b_is_defined,axiom,
    defined(b),
    file('theBenchmark.p',b_is_defined) ).

cnf(c_29,plain,
    defined(b),
    inference(clausify,[status(thm)],[b_is_defined]) ).

fof(multiply_equals_c_5,axiom,
    equalish(multiply(a,b),c),
    file('theBenchmark.p',multiply_equals_c_5) ).

cnf(c_32,plain,
    equalish(multiply(a,b),c),
    inference(clausify,[status(thm)],[multiply_equals_c_5]) ).

fof(a_equals_d_6,axiom,
    equalish(a,d),
    file('theBenchmark.p',a_equals_d_6) ).

cnf(c_33,plain,
    equalish(a,d),
    inference(clausify,[status(thm)],[a_equals_d_6]) ).

fof(multiply_not_equal_to_c_7,axiom,
    ~ equalish(multiply(d,b),c),
    file('theBenchmark.p',multiply_not_equal_to_c_7) ).

cnf(c_34,plain,
    ~ equalish(multiply(d,b),c),
    inference(clausify,[status(thm)],[multiply_not_equal_to_c_7]) ).

cnf(c_296,plain,
    equalish(d,a),
    inference(resolve,[status(thm)],[c_33,c_22]) ).

cnf(c_401,plain,
    ( ~ equalish(A,c)
    | ~ equalish(multiply(d,b),A) ),
    inference(resolve,[status(thm)],[c_23,c_34]) ).

cnf(c_297,plain,
    ~ equalish(multiply(d,b),multiply(a,b)),
    inference(resolve,[status(thm)],[c_401,c_32]) ).

cnf(c_402,plain,
    ( ~ equalish(d,a)
    | ~ defined(b) ),
    inference(resolve,[status(thm)],[c_25,c_297]) ).

cnf(c_403,plain,
    ~ equalish(d,a),
    inference(resolve,[status(thm)],[c_402,c_29]) ).

cnf(c_400,plain,
    $false,
    inference(resolve,[status(thm)],[c_296,c_403]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD030-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n013.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sun Sep 27 02:24:21 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35  % Process 4010288 was started by sandbox on n013,
% 0.09/0.35  % Sun Sep 27 02:24:21 2026
% 0.09/0.35  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/0.36  
% 0.14/0.36  % From the command line: assign(max_seconds, 300).
% 0.14/0.38  
% 0.14/0.38  % SZS status Unsatisfiable for theBenchmark
% 0.14/0.38  
% 0.14/0.38  % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.14/0.38  % Length of proof is 10.
% 0.14/0.38  % Level of proof is 2.
% 0.14/0.38  % Maximum clause weight is 22.000.
% 0.14/0.38  % Given clauses 57.
% 0.14/0.38  
% 0.14/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------