↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : COL014-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 06:57:24 AM UTC 2026

% Result   : Unsatisfiable 0.16s 0.43s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    7 (   7 unt;   0 def)
%            Number of atoms       :    7 (   6 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn   3   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(l_definition,axiom,
    ! [VAR_0,VAR_1] : apply(apply(l,VAR_0),VAR_1) = apply(VAR_0,apply(VAR_1,VAR_1)),
    file('theBenchmark.p',l_definition) ).

cnf(c_1,plain,
    apply(apply(l,A),B) = apply(A,apply(B,B)),
    inference(clausify,[status(thm)],[l_definition]) ).

fof(prove_fixed_point,axiom,
    ! [VAR_0] : VAR_0 != apply(combinator,VAR_0),
    file('theBenchmark.p',prove_fixed_point) ).

cnf(c_3,plain,
    A != apply(combinator,A),
    inference(clausify,[status(thm)],[prove_fixed_point]) ).

cnf(c_4,plain,
    apply(combinator,A) != A,
    inference(copy,[status(thm)],[c_3]) ).

cnf(c_6,plain,
    apply(A,apply(B,B)) = apply(apply(l,A),B),
    inference(copy,[status(thm)],[c_1]) ).

cnf(c_5,plain,
    $false,
    inference(resolve,[status(thm)],[c_4,c_6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : COL014-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.16/0.41  % Computer : n009.cluster.edu
% 0.16/0.41  % Model    : x86_64 x86_64
% 0.16/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41  % Memory   : 8046.5625MB
% 0.16/0.41  % OS       : Linux 6.8.0-71-generic
% 0.16/0.42  % CPULimit : 300
% 0.16/0.42  % WCLimit  : 300
% 0.16/0.42  % DateTime : Sat Sep 26 23:05:44 UTC 2026
% 0.16/0.42  % CPUTime  : 
% 0.16/0.42  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.42  % Process 1370337 was started by sandbox on n009,
% 0.16/0.42  % Sat Sep 26 23:05:44 2026
% 0.16/0.42  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.16/0.43  
% 0.16/0.43  % From the command line: assign(max_seconds, 300).
% 0.16/0.43  
% 0.16/0.43  % SZS status Unsatisfiable for theBenchmark
% 0.16/0.43  
% 0.16/0.43  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.16/0.43  % Length of proof is 4.
% 0.16/0.43  % Level of proof is 2.
% 0.16/0.43  % Maximum clause weight is 26.000.
% 0.16/0.43  % Given clauses 0.
% 0.16/0.43  
% 0.16/0.43  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------