↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : GRP546-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/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:30:20 AM UTC 2026

% Result   : Unsatisfiable 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   19 (  19 unt;   0 def)
%            Number of atoms       :   19 (  18 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
    ! [VAR_0,VAR_1,VAR_2] : divide(divide(identity,divide(VAR_0,VAR_1)),divide(divide(VAR_1,VAR_2),VAR_0)) = VAR_2,
    file('theBenchmark.p',single_axiom) ).

cnf(c_1,plain,
    divide(divide(identity,divide(A,B)),divide(divide(B,C),A)) = C,
    inference(clausify,[status(thm)],[single_axiom]) ).

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

cnf(c_2,plain,
    multiply(A,B) = divide(A,divide(identity,B)),
    inference(clausify,[status(thm)],[multiply]) ).

fof(inverse,axiom,
    ! [VAR_0] : inverse(VAR_0) = divide(identity,VAR_0),
    file('theBenchmark.p',inverse) ).

cnf(c_3,plain,
    inverse(A) = divide(identity,A),
    inference(clausify,[status(thm)],[inverse]) ).

fof(identity,axiom,
    ! [VAR_0] : identity = divide(VAR_0,VAR_0),
    file('theBenchmark.p',identity) ).

cnf(c_4,plain,
    identity = divide(A,A),
    inference(clausify,[status(thm)],[identity]) ).

cnf(c_5,plain,
    divide(A,A) = identity,
    inference(copy,[status(thm)],[c_4]) ).

fof(prove_these_axioms_2,axiom,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    file('theBenchmark.p',prove_these_axioms_2) ).

cnf(c_6,plain,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    inference(clausify,[status(thm)],[prove_these_axioms_2]) ).

cnf(c_37,plain,
    multiply(multiply(divide(identity,b2),b2),a2) != a2,
    inference(paramod,[status(thm)],[c_3,c_6]) ).

cnf(c_38,plain,
    multiply(divide(divide(identity,b2),divide(identity,b2)),a2) != a2,
    inference(paramod,[status(thm)],[c_2,c_37]) ).

cnf(c_39,plain,
    multiply(identity,a2) != a2,
    inference(paramod,[status(thm)],[c_5,c_38]) ).

cnf(c_7,plain,
    divide(identity,divide(identity,a2)) != a2,
    inference(paramod,[status(thm)],[c_2,c_39]) ).

cnf(c_40,plain,
    divide(divide(identity,identity),divide(divide(A,B),A)) = B,
    inference(paramod,[status(thm)],[c_5,c_1]) ).

cnf(c_11,plain,
    divide(identity,divide(divide(A,B),A)) = B,
    inference(paramod,[status(thm)],[c_5,c_40]) ).

cnf(c_35,plain,
    divide(identity,divide(identity,A)) = A,
    inference(paramod,[status(thm)],[c_5,c_11]) ).

cnf(c_36,plain,
    $false,
    inference(resolve,[status(thm)],[c_35,c_7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP546-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n005.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 : Fri Sep 25 14:59:17 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 3771536 was started by sandbox on n005,
% 0.09/0.35  % Fri Sep 25 14:59:17 2026
% 0.09/0.35  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.36  
% 0.09/0.36  % From the command line: assign(max_seconds, 300).
% 0.13/0.37  
% 0.13/0.37  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.37  
% 0.13/0.37  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/0.37  % Length of proof is 10.
% 0.13/0.37  % Level of proof is 4.
% 0.13/0.37  % Maximum clause weight is 13.000.
% 0.13/0.37  % Given clauses 8.
% 0.13/0.37  
% 0.13/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------