↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN692-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 : n011.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:39:08 AM UTC 2026

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

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

cnf(c_7,plain,
    p10(A,A),
    inference(clausify,[status(thm)],[p10_7]) ).

fof(p2_12,axiom,
    ! [VAR_0] : p2(VAR_0,VAR_0),
    file('theBenchmark.p',p2_12) ).

cnf(c_12,plain,
    p2(A,A),
    inference(clausify,[status(thm)],[p2_12]) ).

fof(p2_16,axiom,
    p2(c44,c45),
    file('theBenchmark.p',p2_16) ).

cnf(c_16,plain,
    p2(c44,c45),
    inference(clausify,[status(thm)],[p2_16]) ).

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

cnf(c_33,plain,
    ( ~ p2(A,B)
    | p3(f4(A),f4(B)) ),
    inference(clausify,[status(thm)],[p3_33]) ).

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

cnf(c_39,plain,
    ( ~ p2(C,B)
    | ~ p2(C,A)
    | p2(A,B) ),
    inference(clausify,[status(thm)],[p2_39]) ).

fof(p2_51,axiom,
    p2(f11(f4(f23(c44,f9(f20(c37)))),c43),f11(f4(c44),c43)),
    file('theBenchmark.p',p2_51) ).

cnf(c_51,plain,
    p2(f11(f4(f23(c44,f9(f20(c37)))),c43),f11(f4(c44),c43)),
    inference(clausify,[status(thm)],[p2_51]) ).

fof(not_p2_52,axiom,
    ~ p2(f11(f4(c45),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
    file('theBenchmark.p',not_p2_52) ).

cnf(c_52,plain,
    ~ p2(f11(f4(c45),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
    inference(clausify,[status(thm)],[not_p2_52]) ).

fof(p2_57,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ p3(VAR_0,VAR_2)
      | ~ p10(VAR_1,VAR_3)
      | p2(f11(VAR_0,VAR_1),f11(VAR_2,VAR_3)) ),
    file('theBenchmark.p',p2_57) ).

cnf(c_57,plain,
    ( ~ p3(A,C)
    | ~ p10(B,D)
    | p2(f11(A,B),f11(C,D)) ),
    inference(clausify,[status(thm)],[p2_57]) ).

cnf(c_84,plain,
    p3(f4(c44),f4(c45)),
    inference(resolve,[status(thm)],[c_33,c_16]) ).

cnf(c_94,plain,
    ( ~ p2(B,A)
    | p2(A,B) ),
    inference(resolve,[status(thm)],[c_39,c_12]) ).

cnf(c_144,plain,
    ( ~ p3(A,C)
    | p2(f11(A,B),f11(C,B)) ),
    inference(resolve,[status(thm)],[c_57,c_7]) ).

cnf(c_205,plain,
    p2(f11(f4(c44),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
    inference(resolve,[status(thm)],[c_94,c_51]) ).

cnf(c_1314,plain,
    p2(f11(f4(c44),A),f11(f4(c45),A)),
    inference(resolve,[status(thm)],[c_144,c_84]) ).

cnf(c_1517,plain,
    ( ~ p2(A,f11(f4(f23(c44,f9(f20(c37)))),c43))
    | ~ p2(A,f11(f4(c45),c43)) ),
    inference(resolve,[status(thm)],[c_39,c_52]) ).

cnf(c_1518,plain,
    ~ p2(f11(f4(c44),c43),f11(f4(c45),c43)),
    inference(resolve,[status(thm)],[c_1517,c_205]) ).

cnf(c_1516,plain,
    $false,
    inference(resolve,[status(thm)],[c_1314,c_1518]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SYN692-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.42  % Computer : n011.cluster.edu
% 0.14/0.42  % Model    : x86_64 x86_64
% 0.14/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.42  % Memory   : 8046.5625MB
% 0.14/0.42  % OS       : Linux 6.8.0-71-generic
% 0.14/0.42  % CPULimit : 300
% 0.14/0.42  % WCLimit  : 300
% 0.14/0.42  % DateTime : Sat Sep 26 18:20:29 UTC 2026
% 0.14/0.43  % CPUTime  : 
% 0.14/0.43  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.14/0.43  % Process 1249627 was started by sandbox on n011,
% 0.14/0.43  % Sat Sep 26 18:20:29 2026
% 0.14/0.43  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/0.44  
% 0.14/0.44  % From the command line: assign(max_seconds, 300).
% 0.95/0.71  
% 0.95/0.71  % SZS status Unsatisfiable for theBenchmark
% 0.95/0.71  
% 0.95/0.71  % Proof 1 at 0.19 (+ 0.07) seconds.
% 0.95/0.71  % Length of proof is 14.
% 0.95/0.71  % Level of proof is 3.
% 0.95/0.71  % Maximum clause weight is 25.000.
% 0.95/0.71  % Given clauses 355.
% 0.95/0.71  
% 0.95/0.71  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------