↑ Up

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

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

% Computer : n009.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:36:58 AM UTC 2026

% Result   : Unsatisfiable 0.15s 0.44s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   30 (  13 unt;   0 def)
%            Number of atoms       :   48 (  32 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   31 (  13   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    4 (   0 sgn   1   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(clause_1,axiom,
    ! [VAR_0] :
      ( VAR_0 = d
      | VAR_0 = c ),
    file('theBenchmark.p',clause_1) ).

cnf(c_1,plain,
    ( A = d
    | A = c ),
    inference(clausify,[status(thm)],[clause_1]) ).

cnf(c_29,plain,
    ( A = d
    | c = A ),
    inference(copy,[status(thm)],[c_1]) ).

cnf(c_2,plain,
    ( d = A
    | c = A ),
    inference(copy,[status(thm)],[c_29]) ).

fof(clause_2,axiom,
    big_p(a),
    file('theBenchmark.p',clause_2) ).

cnf(c_3,plain,
    big_p(a),
    inference(clausify,[status(thm)],[clause_2]) ).

fof(clause_3,axiom,
    big_p(b),
    file('theBenchmark.p',clause_3) ).

cnf(c_4,plain,
    big_p(b),
    inference(clausify,[status(thm)],[clause_3]) ).

fof(clause_4,axiom,
    a != b,
    file('theBenchmark.p',clause_4) ).

cnf(c_5,plain,
    a != b,
    inference(clausify,[status(thm)],[clause_4]) ).

cnf(c_6,plain,
    b != a,
    inference(copy,[status(thm)],[c_5]) ).

fof(prove_this,axiom,
    ~ big_p(e),
    file('theBenchmark.p',prove_this) ).

cnf(c_7,plain,
    ~ big_p(e),
    inference(clausify,[status(thm)],[prove_this]) ).

cnf(c_9,plain,
    ( big_p(d)
    | c = a ),
    inference(paramod,[status(thm)],[c_2,c_3]) ).

cnf(c_10,plain,
    ( big_p(d)
    | c = b ),
    inference(paramod,[status(thm)],[c_2,c_4]) ).

cnf(c_11,plain,
    ( d != a
    | c = b ),
    inference(paramod,[status(thm)],[c_2,c_6]) ).

cnf(c_30,plain,
    ( ~ big_p(d)
    | c = e ),
    inference(paramod,[status(thm)],[c_2,c_7]) ).

cnf(c_13,plain,
    ( ~ big_p(d)
    | e = c ),
    inference(copy,[status(thm)],[c_30]) ).

cnf(c_16,plain,
    ( c = b
    | e = c ),
    inference(resolve,[status(thm)],[c_13,c_10]) ).

cnf(c_17,plain,
    ( c = a
    | e = c ),
    inference(resolve,[status(thm)],[c_13,c_9]) ).

cnf(c_19,plain,
    ( c = a
    | c = b ),
    inference(resolve,[status(thm)],[c_11,c_2]) ).

cnf(c_22,plain,
    ( ~ big_p(c)
    | c = b ),
    inference(paramod,[status(thm)],[c_16,c_7]) ).

cnf(c_23,plain,
    ( ~ big_p(c)
    | c = a ),
    inference(paramod,[status(thm)],[c_17,c_7]) ).

cnf(c_31,plain,
    ( ~ big_p(b)
    | c = a
    | c = a ),
    inference(paramod,[status(thm)],[c_19,c_23]) ).

cnf(c_32,plain,
    ( ~ big_p(b)
    | c = a ),
    inference(copy,[status(thm)],[c_31]) ).

cnf(c_25,plain,
    c = a,
    inference(resolve,[status(thm)],[c_4,c_32]) ).

cnf(c_33,plain,
    ( ~ big_p(a)
    | c = b ),
    inference(paramod,[status(thm)],[c_25,c_22]) ).

cnf(c_27,plain,
    c = b,
    inference(resolve,[status(thm)],[c_3,c_33]) ).

cnf(c_34,plain,
    b = a,
    inference(paramod,[status(thm)],[c_27,c_25]) ).

cnf(c_28,plain,
    $false,
    inference(resolve,[status(thm)],[c_6,c_34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SYN072-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.41  % Computer : n009.cluster.edu
% 0.15/0.41  % Model    : x86_64 x86_64
% 0.15/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41  % Memory   : 8046.5625MB
% 0.15/0.41  % OS       : Linux 6.8.0-71-generic
% 0.15/0.41  % CPULimit : 300
% 0.15/0.41  % WCLimit  : 300
% 0.15/0.41  % DateTime : Sat Sep 26 17:09:29 UTC 2026
% 0.15/0.41  % CPUTime  : 
% 0.15/0.42  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/0.42  % Process 686142 was started by sandbox on n009,
% 0.15/0.42  % Sat Sep 26 17:09:29 2026
% 0.15/0.42  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.15/0.42  
% 0.15/0.42  % From the command line: assign(max_seconds, 300).
% 0.15/0.44  
% 0.15/0.44  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.44  
% 0.15/0.44  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/0.44  % Length of proof is 19.
% 0.15/0.44  % Level of proof is 7.
% 0.15/0.44  % Maximum clause weight is 11.000.
% 0.15/0.44  % Given clauses 17.
% 0.15/0.44  
% 0.15/0.44  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------