↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : GRP562-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 : n018.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:22 AM UTC 2026

% Result   : Unsatisfiable 0.10s 0.40s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (  14 unt;   0 def)
%            Number of atoms       :   14 (  13 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    8 (   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   :   24 (   0 sgn   5   !;   0   ?)

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

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

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

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

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

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

cnf(c_30,plain,
    multiply(divide(inverse(b2),inverse(b2)),a2) != a2,
    inference(paramod,[status(thm)],[c_2,c_3]) ).

cnf(c_4,plain,
    divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2,
    inference(paramod,[status(thm)],[c_2,c_30]) ).

cnf(c_6,plain,
    divide(divide(divide(divide(divide(A,inverse(B)),C),inverse(D)),divide(A,C)),B) = D,
    inference(paramod,[status(thm)],[c_1,c_1]) ).

cnf(c_31,plain,
    divide(divide(A,divide(divide(divide(B,inverse(inverse(C))),D),divide(B,D))),A) = C,
    inference(paramod,[status(thm)],[c_6,c_6]) ).

cnf(c_16,plain,
    divide(divide(A,inverse(B)),A) = B,
    inference(paramod,[status(thm)],[c_1,c_31]) ).

cnf(c_19,plain,
    divide(A,divide(B,B)) = A,
    inference(paramod,[status(thm)],[c_16,c_1]) ).

cnf(c_28,plain,
    divide(divide(A,A),inverse(B)) = B,
    inference(paramod,[status(thm)],[c_19,c_16]) ).

cnf(c_29,plain,
    $false,
    inference(resolve,[status(thm)],[c_28,c_4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP562-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.38  % Computer : n018.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Fri Sep 25 15:02:05 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.38  % Process 2249043 was started by sandbox on n018,
% 0.10/0.38  % Fri Sep 25 15:02:05 2026
% 0.10/0.38  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.38  
% 0.10/0.38  % From the command line: assign(max_seconds, 300).
% 0.10/0.40  
% 0.10/0.40  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.40  
% 0.10/0.40  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.40  % Length of proof is 9.
% 0.10/0.40  % Level of proof is 5.
% 0.10/0.40  % Maximum clause weight is 17.000.
% 0.10/0.40  % Given clauses 7.
% 0.10/0.40  
% 0.10/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------