↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN080-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n014.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 09:37:00 AM UTC 2026

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

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

cnf(c_1,plain,
    f(A) = g(B),
    inference(clausify,[status(thm)],[clause_1]) ).

cnf(c_2,plain,
    g(A) = f(B),
    inference(copy,[status(thm)],[c_1]) ).

fof(prove_this,axiom,
    f(f(a)) != f(g(b)),
    file('theBenchmark.p',prove_this) ).

cnf(c_3,plain,
    f(f(a)) != f(g(b)),
    inference(clausify,[status(thm)],[prove_this]) ).

cnf(c_4,plain,
    f(g(b)) != f(f(a)),
    inference(copy,[status(thm)],[c_3]) ).

cnf(c_5,plain,
    f(A) = f(B),
    inference(paramod,[status(thm)],[c_2,c_2]) ).

cnf(c_6,plain,
    $false,
    inference(resolve,[status(thm)],[c_5,c_4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN080-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n014.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 : Sat Sep 26 17:10:01 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 3692382 was started by sandbox2 on n014,
% 0.09/0.35  % Sat Sep 26 17:10:01 2026
% 0.09/0.35  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.36  
% 0.09/0.36  % From the command line: assign(max_seconds, 300).
% 0.09/0.37  
% 0.09/0.37  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.37  
% 0.09/0.37  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.37  % Length of proof is 6.
% 0.09/0.37  % Level of proof is 3.
% 0.09/0.37  % Maximum clause weight is 7.000.
% 0.09/0.37  % Given clauses 1.
% 0.09/0.37  
% 0.09/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------