↑ Up

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

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

% Computer : n016.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:39 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(clause1,axiom,
    ! [VAR_0,VAR_1] : f(b,z1(VAR_0,VAR_1)),
    file('theBenchmark.p',clause1) ).

cnf(c_1,plain,
    f(b,z1(A,B)),
    inference(clausify,[status(thm)],[clause1]) ).

fof(clause3,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ f(VAR_1,z1(VAR_0,VAR_1))
      | ~ f(VAR_0,z1(VAR_0,VAR_1)) ),
    file('theBenchmark.p',clause3) ).

cnf(c_3,plain,
    ( ~ f(B,z1(A,B))
    | ~ f(A,z1(A,B)) ),
    inference(clausify,[status(thm)],[clause3]) ).

cnf(c_5,plain,
    ~ f(A,z1(b,A)),
    inference(resolve,[status(thm)],[c_3,c_1]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN346-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n016.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep 26 17:41:45 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.37  % Process 1399117 was started by sandbox on n016,
% 0.11/0.37  % Sat Sep 26 17:41:45 2026
% 0.11/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/0.37  
% 0.11/0.37  % From the command line: assign(max_seconds, 300).
% 0.11/0.38  
% 0.11/0.38  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.38  
% 0.11/0.38  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.11/0.38  % Length of proof is 4.
% 0.11/0.38  % Level of proof is 2.
% 0.11/0.38  % Maximum clause weight is 10.000.
% 0.11/0.38  % Given clauses 3.
% 0.11/0.38  
% 0.11/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------