↑ Up

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

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

% Computer : n007.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:55 AM UTC 2026

% Result   : Unsatisfiable 0.12s 0.37s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   20 (  13 unt;   0 def)
%            Number of atoms       :   34 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   33 (  19   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-3 aty)
%            Number of variables   :   21 (   0 sgn   9   !;   0   ?)

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

cnf(c_1,plain,
    p10(A,A),
    inference(clausify,[status(thm)],[p10_1]) ).

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

cnf(c_4,plain,
    p2(A,A),
    inference(clausify,[status(thm)],[p2_4]) ).

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

cnf(c_15,plain,
    ( ~ p10(C,B)
    | ~ p10(C,A)
    | p10(A,B) ),
    inference(clausify,[status(thm)],[p10_15]) ).

fof(p18_20,axiom,
    p18(c20,f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24)),
    file('theBenchmark.p',p18_20) ).

cnf(c_20,plain,
    p18(c20,f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24)),
    inference(clausify,[status(thm)],[p18_20]) ).

fof(not_p18_21,axiom,
    ~ p18(c20,f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)),
    file('theBenchmark.p',not_p18_21) ).

cnf(c_21,plain,
    ~ p18(c20,f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)),
    inference(clausify,[status(thm)],[not_p18_21]) ).

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

cnf(c_23,plain,
    ( ~ p10(D,B)
    | ~ p2(C,A)
    | ~ p18(C,D)
    | p18(A,B) ),
    inference(clausify,[status(thm)],[p18_23]) ).

fof(p10_28,axiom,
    p10(f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24),f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24)),
    file('theBenchmark.p',p10_28) ).

cnf(c_28,plain,
    p10(f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24),f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24)),
    inference(clausify,[status(thm)],[p10_28]) ).

cnf(c_34,plain,
    ( ~ p10(B,f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24))
    | ~ p2(A,c20)
    | ~ p18(A,B) ),
    inference(resolve,[status(thm)],[c_23,c_21]) ).

cnf(c_35,plain,
    ( ~ p10(f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24),f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24))
    | ~ p2(c20,c20) ),
    inference(resolve,[status(thm)],[c_34,c_20]) ).

cnf(c_30,plain,
    ~ p10(f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24),f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)),
    inference(resolve,[status(thm)],[c_35,c_4]) ).

cnf(c_36,plain,
    ( ~ p10(f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24),A)
    | p10(f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24),A) ),
    inference(resolve,[status(thm)],[c_15,c_28]) ).

cnf(c_32,plain,
    p10(f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24),f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)),
    inference(resolve,[status(thm)],[c_36,c_1]) ).

cnf(c_33,plain,
    $false,
    inference(resolve,[status(thm)],[c_32,c_30]) ).

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