↑ Up

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

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

% Computer : n020.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 07:59:56 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(cls_conjecture_0,axiom,
    c_List_Ofoldl(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Olist_OCons(hAPP(hAPP(c_Lambda_Olift,v_ta____),c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB) != hAPP(hAPP(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(c_HOL_Ozero__class_Ozero(tc_nat))),hAPP(hAPP(c_Lambda_Olift,v_ta____),c_HOL_Ozero__class_Ozero(tc_nat))),
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(c_435,plain,
    c_List_Ofoldl(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Olist_OCons(hAPP(hAPP(c_Lambda_Olift,v_ta____),c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB) != hAPP(hAPP(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(c_HOL_Ozero__class_Ozero(tc_nat))),hAPP(hAPP(c_Lambda_Olift,v_ta____),c_HOL_Ozero__class_Ozero(tc_nat))),
    inference(clausify,[status(thm)],[cls_conjecture_0]) ).

fof(cls_foldl__Cons_0,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] : c_List_Ofoldl(VAR_0,VAR_1,c_List_Olist_OCons(VAR_2,VAR_3,VAR_4),VAR_5,VAR_4) = c_List_Ofoldl(VAR_0,hAPP(hAPP(VAR_0,VAR_1),VAR_2),VAR_3,VAR_5,VAR_4),
    file('theBenchmark.p',cls_foldl__Cons_0) ).

cnf(c_444,plain,
    c_List_Ofoldl(A,B,c_List_Olist_OCons(C,D,E),F,E) = c_List_Ofoldl(A,hAPP(hAPP(A,B),C),D,F,E),
    inference(clausify,[status(thm)],[cls_foldl__Cons_0]) ).

cnf(c_445,plain,
    c_List_Ofoldl(A,hAPP(hAPP(A,B),C),D,E,F) = c_List_Ofoldl(A,B,c_List_Olist_OCons(C,D,F),E,F),
    inference(copy,[status(thm)],[c_444]) ).

fof(cls_foldl__Nil_0,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] : c_List_Ofoldl(VAR_0,VAR_1,c_List_Olist_ONil(VAR_2),VAR_3,VAR_2) = VAR_1,
    file('theBenchmark.p',cls_foldl__Nil_0) ).

cnf(c_449,plain,
    c_List_Ofoldl(A,B,c_List_Olist_ONil(C),D,C) = B,
    inference(clausify,[status(thm)],[cls_foldl__Nil_0]) ).

cnf(c_1451,plain,
    hAPP(hAPP(A,B),C) = c_List_Ofoldl(A,B,c_List_Olist_OCons(C,c_List_Olist_ONil(D),D),E,D),
    inference(paramod,[status(thm)],[c_449,c_445]) ).

cnf(c_1449,plain,
    c_List_Ofoldl(A,B,c_List_Olist_OCons(C,c_List_Olist_ONil(D),D),E,D) = hAPP(hAPP(A,B),C),
    inference(copy,[status(thm)],[c_1451]) ).

cnf(c_1450,plain,
    $false,
    inference(resolve,[status(thm)],[c_1449,c_435]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL849-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n020.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Fri Sep 25 23:44:18 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.36  % Process 4096506 was started by sandbox on n020,
% 0.10/0.36  % Fri Sep 25 23:44:18 2026
% 0.10/0.36  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.39  
% 0.10/0.39  % From the command line: assign(max_seconds, 300).
% 3.81/1.30  
% 3.81/1.30  % SZS status Unsatisfiable for theBenchmark
% 3.81/1.30  
% 3.81/1.30  % Proof 1 at 0.47 (+ 0.02) seconds.
% 3.81/1.30  % Length of proof is 6.
% 3.81/1.30  % Level of proof is 3.
% 3.81/1.30  % Maximum clause weight is 55.000.
% 3.81/1.30  % Given clauses 159.
% 3.81/1.30  
% 3.81/1.30  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------