↑ Up

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

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

% Computer : n010.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:09:10 AM UTC 2026

% Result   : Unsatisfiable 0.10s 20.63s
% Output   : CNFRefutation 0.10s
% 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 :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    3 (   2 sgn   1   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(cls_conjecture_0,axiom,
    v_s != v_t,
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(c_3,plain,
    v_s != v_t,
    inference(clausify,[status(thm)],[cls_conjecture_0]) ).

cnf(c_4,plain,
    v_t != v_s,
    inference(copy,[status(thm)],[c_3]) ).

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

cnf(c_5,plain,
    A = v_ta,
    inference(clausify,[status(thm)],[cls_conjecture_1]) ).

cnf(c_6,plain,
    v_ta = A,
    inference(copy,[status(thm)],[c_5]) ).

cnf(c_7,plain,
    v_ta != v_s,
    inference(paramod,[status(thm)],[c_6,c_4]) ).

cnf(c_8,plain,
    $false,
    inference(resolve,[status(thm)],[c_7,c_6]) ).

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