↑ Up

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

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

% Computer : n012.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:38:53 AM UTC 2026

% Result   : Unsatisfiable 0.03s 0.31s
% Output   : CNFRefutation 0.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   23 (  14 unt;   0 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   40 (  24   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   27 (   0 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(p2_2,axiom,
    ! [VAR_0] : p2(VAR_0,VAR_0),
    file('theBenchmark.p',p2_2) ).

cnf(c_2,plain,
    p2(A,A),
    inference(clausify,[status(thm)],[p2_2]) ).

fof(p5_3,axiom,
    ! [VAR_0] : p5(VAR_0,VAR_0),
    file('theBenchmark.p',p5_3) ).

cnf(c_3,plain,
    p5(A,A),
    inference(clausify,[status(thm)],[p5_3]) ).

fof(p2_5,axiom,
    p2(c13,c18),
    file('theBenchmark.p',p2_5) ).

cnf(c_5,plain,
    p2(c13,c18),
    inference(clausify,[status(thm)],[p2_5]) ).

fof(p11_7,axiom,
    p11(f4(f6(c15,c13)),c16),
    file('theBenchmark.p',p11_7) ).

cnf(c_7,plain,
    p11(f4(f6(c15,c13)),c16),
    inference(clausify,[status(thm)],[p11_7]) ).

fof(not_p11_9,axiom,
    ~ p11(f4(f6(c15,c18)),c16),
    file('theBenchmark.p',not_p11_9) ).

cnf(c_9,plain,
    ~ p11(f4(f6(c15,c18)),c16),
    inference(clausify,[status(thm)],[not_p11_9]) ).

fof(p2_14,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ p2(VAR_0,VAR_1)
      | p2(f4(VAR_0),f4(VAR_1)) ),
    file('theBenchmark.p',p2_14) ).

cnf(c_14,plain,
    ( ~ p2(A,B)
    | p2(f4(A),f4(B)) ),
    inference(clausify,[status(thm)],[p2_14]) ).

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

cnf(c_21,plain,
    ( ~ p11(C,D)
    | ~ p2(D,B)
    | ~ p2(C,A)
    | p11(A,B) ),
    inference(clausify,[status(thm)],[p11_21]) ).

fof(p2_23,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ p5(VAR_0,VAR_2)
      | ~ p2(VAR_1,VAR_3)
      | p2(f6(VAR_0,VAR_1),f6(VAR_2,VAR_3)) ),
    file('theBenchmark.p',p2_23) ).

cnf(c_23,plain,
    ( ~ p5(A,C)
    | ~ p2(B,D)
    | p2(f6(A,B),f6(C,D)) ),
    inference(clausify,[status(thm)],[p2_23]) ).

cnf(c_111,plain,
    ( ~ p11(A,B)
    | ~ p2(B,c16)
    | ~ p2(A,f4(f6(c15,c18))) ),
    inference(resolve,[status(thm)],[c_21,c_9]) ).

cnf(c_112,plain,
    ( ~ p11(A,c16)
    | ~ p2(A,f4(f6(c15,c18))) ),
    inference(resolve,[status(thm)],[c_111,c_2]) ).

cnf(c_51,plain,
    ~ p2(f4(f6(c15,c13)),f4(f6(c15,c18))),
    inference(resolve,[status(thm)],[c_112,c_7]) ).

cnf(c_109,plain,
    ~ p2(f6(c15,c13),f6(c15,c18)),
    inference(resolve,[status(thm)],[c_14,c_51]) ).

cnf(c_113,plain,
    ( ~ p5(c15,c15)
    | ~ p2(c13,c18) ),
    inference(resolve,[status(thm)],[c_23,c_109]) ).

cnf(c_114,plain,
    ~ p2(c13,c18),
    inference(resolve,[status(thm)],[c_113,c_3]) ).

cnf(c_110,plain,
    $false,
    inference(resolve,[status(thm)],[c_5,c_114]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SYN582-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.02  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.30  % Computer : n012.cluster.edu
% 0.03/0.30  % Model    : x86_64 x86_64
% 0.03/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30  % Memory   : 8046.5625MB
% 0.03/0.30  % OS       : Linux 6.8.0-71-generic
% 0.03/0.30  % CPULimit : 300
% 0.03/0.30  % WCLimit  : 300
% 0.03/0.30  % DateTime : Sat Sep 26 18:14:35 UTC 2026
% 0.03/0.30  % CPUTime  : 
% 0.03/0.30  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.03/0.30  % Process 1217673 was started by sandbox on n012,
% 0.03/0.30  % Sat Sep 26 18:14:35 2026
% 0.03/0.30  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.03/0.30  
% 0.03/0.30  % From the command line: assign(max_seconds, 300).
% 0.03/0.31  
% 0.03/0.31  % SZS status Unsatisfiable for theBenchmark
% 0.03/0.31  
% 0.03/0.31  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.03/0.31  % Length of proof is 11.
% 0.03/0.31  % Level of proof is 3.
% 0.03/0.31  % Maximum clause weight is 13.000.
% 0.03/0.31  % Given clauses 59.
% 0.03/0.31  
% 0.03/0.31  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------