↑ Up

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

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

% Result   : Unsatisfiable 0.10s 6.02s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (  22 unt;   0 def)
%            Number of atoms       :   22 (  21 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    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   27 (   0 sgn   7   !;   0   ?)

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

cnf(c_2,plain,
    ld(A,mult(A,B)) = B,
    inference(clausify,[status(thm)],[c02]) ).

fof(c06,axiom,
    ! [VAR_0] : mult(unit,VAR_0) = VAR_0,
    file('theBenchmark.p',c06) ).

cnf(c_6,plain,
    mult(unit,A) = A,
    inference(clausify,[status(thm)],[c06]) ).

fof(c07,axiom,
    ! [VAR_0,VAR_1,VAR_2] : mult(VAR_0,mult(VAR_1,mult(VAR_0,VAR_2))) = mult(mult(VAR_0,mult(VAR_1,VAR_0)),VAR_2),
    file('theBenchmark.p',c07) ).

cnf(c_7,plain,
    mult(A,mult(B,mult(A,C))) = mult(mult(A,mult(B,A)),C),
    inference(clausify,[status(thm)],[c07]) ).

cnf(c_8,plain,
    mult(mult(A,mult(B,A)),C) = mult(A,mult(B,mult(A,C))),
    inference(copy,[status(thm)],[c_7]) ).

fof(c08,axiom,
    ! [VAR_0] : mult(op_c,VAR_0) = mult(VAR_0,op_c),
    file('theBenchmark.p',c08) ).

cnf(c_9,plain,
    mult(op_c,A) = mult(A,op_c),
    inference(clausify,[status(thm)],[c08]) ).

fof(goals,axiom,
    mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
    file('theBenchmark.p',goals) ).

cnf(c_10,plain,
    mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
    inference(clausify,[status(thm)],[goals]) ).

cnf(c_158,plain,
    mult(mult(A,A),B) = mult(A,mult(unit,mult(A,B))),
    inference(paramod,[status(thm)],[c_6,c_8]) ).

cnf(c_22,plain,
    mult(mult(A,A),B) = mult(A,mult(A,B)),
    inference(paramod,[status(thm)],[c_6,c_158]) ).

cnf(c_159,plain,
    mult(op_c,mult(op_c,a)) != mult(a,mult(op_c,op_c)),
    inference(paramod,[status(thm)],[c_22,c_10]) ).

cnf(c_24,plain,
    mult(a,mult(op_c,op_c)) != mult(op_c,mult(op_c,a)),
    inference(copy,[status(thm)],[c_159]) ).

cnf(c_25,plain,
    ld(op_c,mult(A,op_c)) = A,
    inference(paramod,[status(thm)],[c_9,c_2]) ).

cnf(c_32,plain,
    mult(mult(op_c,mult(op_c,A)),B) = mult(op_c,mult(A,mult(op_c,B))),
    inference(paramod,[status(thm)],[c_9,c_8]) ).

cnf(c_160,plain,
    ld(op_c,mult(op_c,mult(A,mult(op_c,op_c)))) = mult(op_c,mult(op_c,A)),
    inference(paramod,[status(thm)],[c_32,c_25]) ).

cnf(c_161,plain,
    mult(A,mult(op_c,op_c)) = mult(op_c,mult(op_c,A)),
    inference(paramod,[status(thm)],[c_2,c_160]) ).

cnf(c_156,plain,
    mult(op_c,mult(op_c,A)) = mult(A,mult(op_c,op_c)),
    inference(copy,[status(thm)],[c_161]) ).

cnf(c_162,plain,
    mult(op_c,mult(op_c,a)) != mult(a,mult(op_c,op_c)),
    inference(copy,[status(thm)],[c_24]) ).

cnf(c_157,plain,
    $false,
    inference(resolve,[status(thm)],[c_156,c_162]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP679-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.10/5.98  % Computer : n013.cluster.edu
% 0.10/5.98  % Model    : x86_64 x86_64
% 0.10/5.98  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.98  % Memory   : 8046.5625MB
% 0.10/5.98  % OS       : Linux 6.8.0-71-generic
% 0.10/5.98  % CPULimit : 300
% 0.10/5.98  % WCLimit  : 300
% 0.10/5.98  % DateTime : Fri Sep 25 15:36:08 UTC 2026
% 0.10/5.98  % CPUTime  : 
% 0.10/5.98  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/5.98  % Process 749138 was started by sandbox2 on n013,
% 0.10/5.98  % Fri Sep 25 15:36:08 2026
% 0.10/5.98  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/5.99  
% 0.10/5.99  % From the command line: assign(max_seconds, 300).
% 0.10/6.02  
% 0.10/6.02  % SZS status Unsatisfiable for theBenchmark
% 0.10/6.02  
% 0.10/6.02  % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.10/6.02  % Length of proof is 12.
% 0.10/6.02  % Level of proof is 4.
% 0.10/6.02  % Maximum clause weight is 55.000.
% 0.10/6.02  % Given clauses 39.
% 0.10/6.02  
% 0.10/6.02  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------