↑ Up

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

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

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

% Result   : Unsatisfiable 0.15s 10.50s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   23 (  11 unt;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   33 (  18   ~;  15   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   30 (  12 sgn  11   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(rule_001,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ n0(VAR_1,VAR_0)
      | k1(VAR_0) ),
    file('theBenchmark.p',rule_001) ).

cnf(c_1,plain,
    ( ~ n0(B,A)
    | k1(A) ),
    inference(clausify,[status(thm)],[rule_001]) ).

fof(axiom_37,axiom,
    n0(b,a),
    file('theBenchmark.p',axiom_37) ).

cnf(c_2,plain,
    n0(b,a),
    inference(clausify,[status(thm)],[axiom_37]) ).

fof(axiom_30,axiom,
    n0(e,e),
    file('theBenchmark.p',axiom_30) ).

cnf(c_4,plain,
    n0(e,e),
    inference(clausify,[status(thm)],[axiom_30]) ).

fof(rule_066,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ n0(VAR_1,VAR_0)
      | p1(VAR_0,VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_066) ).

cnf(c_17,plain,
    ( ~ n0(B,A)
    | p1(A,A,A) ),
    inference(clausify,[status(thm)],[rule_066]) ).

fof(rule_174,axiom,
    ! [VAR_0] :
      ( ~ k1(e)
      | ~ n2(VAR_0)
      | p2(VAR_0,VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_174) ).

cnf(c_43,plain,
    ( ~ k1(e)
    | ~ n2(A)
    | p2(A,A,A) ),
    inference(clausify,[status(thm)],[rule_174]) ).

fof(rule_137,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p1(VAR_1,VAR_2,VAR_0)
      | n2(VAR_0) ),
    file('theBenchmark.p',rule_137) ).

cnf(c_46,plain,
    ( ~ p1(B,C,A)
    | n2(A) ),
    inference(clausify,[status(thm)],[rule_137]) ).

fof(rule_240,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p2(VAR_1,VAR_2,VAR_0)
      | n3(VAR_0) ),
    file('theBenchmark.p',rule_240) ).

cnf(c_91,plain,
    ( ~ p2(B,C,A)
    | n3(A) ),
    inference(clausify,[status(thm)],[rule_240]) ).

fof(prove_this,axiom,
    ~ n3(a),
    file('theBenchmark.p',prove_this) ).

cnf(c_98,plain,
    ~ n3(a),
    inference(clausify,[status(thm)],[prove_this]) ).

cnf(c_196,plain,
    ( ~ p1(B,C,A)
    | ~ k1(e)
    | p2(A,A,A) ),
    inference(resolve,[status(thm)],[c_43,c_46]) ).

cnf(c_239,plain,
    p1(a,a,a),
    inference(resolve,[status(thm)],[c_17,c_2]) ).

cnf(c_262,plain,
    k1(e),
    inference(resolve,[status(thm)],[c_1,c_4]) ).

cnf(c_515,plain,
    ~ p2(A,B,a),
    inference(resolve,[status(thm)],[c_91,c_98]) ).

cnf(c_541,plain,
    ( ~ p1(B,C,A)
    | p2(A,A,A) ),
    inference(resolve,[status(thm)],[c_196,c_262]) ).

cnf(c_539,plain,
    p2(a,a,a),
    inference(resolve,[status(thm)],[c_541,c_239]) ).

cnf(c_540,plain,
    $false,
    inference(resolve,[status(thm)],[c_539,c_515]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN153-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/10.38  % Computer : n008.cluster.edu
% 0.11/10.38  % Model    : x86_64 x86_64
% 0.11/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38  % Memory   : 8046.5625MB
% 0.11/10.38  % OS       : Linux 6.8.0-71-generic
% 0.11/10.38  % CPULimit : 300
% 0.11/10.38  % WCLimit  : 300
% 0.11/10.38  % DateTime : Sat Sep 26 17:17:06 UTC 2026
% 0.11/10.39  % CPUTime  : 
% 0.11/10.39  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/10.39  % Process 4137015 was started by sandbox2 on n008,
% 0.11/10.39  % Sat Sep 26 17:17:06 2026
% 0.11/10.39  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.15/10.40  
% 0.15/10.40  % From the command line: assign(max_seconds, 300).
% 0.15/10.50  
% 0.15/10.50  % SZS status Unsatisfiable for theBenchmark
% 0.15/10.50  
% 0.15/10.50  % Proof 1 at 0.09 (+ 0.01) seconds.
% 0.15/10.50  % Length of proof is 14.
% 0.15/10.50  % Level of proof is 3.
% 0.15/10.50  % Maximum clause weight is 10.000.
% 0.15/10.50  % Given clauses 125.
% 0.15/10.50  
% 0.15/10.50  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------