↑ Up

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

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

% Computer : n003.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 08:26:20 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(left_alternative,axiom,
    ! [VAR_0,VAR_1] : multiply(multiply(VAR_0,VAR_0),VAR_1) = multiply(VAR_0,multiply(VAR_0,VAR_1)),
    file('theBenchmark.p',left_alternative) ).

cnf(c_10,plain,
    multiply(multiply(A,A),B) = multiply(A,multiply(A,B)),
    inference(clausify,[status(thm)],[left_alternative]) ).

fof(middle_law,axiom,
    ! [VAR_0,VAR_1] : multiply(multiply(VAR_0,VAR_1),VAR_0) != multiply(VAR_0,multiply(VAR_1,VAR_0)),
    file('theBenchmark.p',middle_law) ).

cnf(c_21,plain,
    multiply(multiply(A,B),A) != multiply(A,multiply(B,A)),
    inference(clausify,[status(thm)],[middle_law]) ).

cnf(c_22,plain,
    $false,
    inference(resolve,[status(thm)],[c_21,c_10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : RNG010-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/5.56  % Computer : n003.cluster.edu
% 0.14/5.56  % Model    : x86_64 x86_64
% 0.14/5.56  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.56  % Memory   : 8046.5625MB
% 0.14/5.56  % OS       : Linux 6.8.0-71-generic
% 0.14/5.57  % CPULimit : 300
% 0.14/5.57  % WCLimit  : 300
% 0.14/5.57  % DateTime : Sat Sep 26 05:46:30 UTC 2026
% 0.14/5.57  % CPUTime  : 
% 0.14/5.57  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.14/5.57  % Process 2158924 was started by sandbox on n003,
% 0.14/5.57  % Sat Sep 26 05:46:30 2026
% 0.14/5.57  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/5.58  
% 0.14/5.58  % From the command line: assign(max_seconds, 300).
% 0.14/5.59  
% 0.14/5.59  % SZS status Unsatisfiable for theBenchmark
% 0.14/5.59  
% 0.14/5.59  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.14/5.59  % Length of proof is 3.
% 0.14/5.59  % Level of proof is 1.
% 0.14/5.59  % Maximum clause weight is 11.000.
% 0.14/5.59  % Given clauses 0.
% 0.14/5.59  
% 0.14/5.59  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------