↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL438-2 : TPTP v9.2.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 04:40:22 PM UTC 2026

% Result   : Unsatisfiable 0.24s 1.62s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (  11 unt;   0 nHn;  11 RR)
%            Number of literals    :   20 (   0 equ;   8 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :   27 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_PropLog_Othms_OS_0,axiom,
    c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X3,X4),X4),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X4),c_PropLog_Opl_Oop_A_N_62(X1,X3,X4),X4),X4),c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OS_0) ).

cnf(cls_PropLog_Othms_OMP_0,axiom,
    ( c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OMP_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_conjecture_4,negated_conjecture,
    ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).

cnf(cls_conjecture_3,negated_conjecture,
    c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(i_0_5,axiom,
    c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X3,X4),X4),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X4),c_PropLog_Opl_Oop_A_N_62(X1,X3,X4),X4),X4),c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4)),
    cls_PropLog_Othms_OS_0,
    [final] ).

cnf(i_0_6,axiom,
    ( c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    cls_PropLog_Othms_OMP_0,
    [final] ).

cnf(i_0_7,negated_conjecture,
    c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    cls_conjecture_1,
    [final] ).

cnf(i_0_8,negated_conjecture,
    ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    cls_conjecture_4,
    [final] ).

cnf(i_0_9,negated_conjecture,
    c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    cls_conjecture_3,
    [final] ).

cnf(i_0_10,plain,
    c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    inference(scs_inference,[],[i_0_7,i_0_5,i_0_6]) ).

cnf(i_0_11,plain,
    c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X3,X4),X4),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X4),c_PropLog_Opl_Oop_A_N_62(X1,X3,X4),X4),X4),c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4)),
    inference(rename_variables,[],[i_0_5]) ).

cnf(i_0_12,plain,
    ( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))
    | c_in(X2,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)) ),
    inference(rename_variables,[],[i_0_6]) ).

cnf(i_0_13,plain,
    $false,
    inference(scs_inference,[],[i_0_10,i_0_9,i_0_8,i_0_6]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13  % Problem    : LCL438-2 : TPTP v9.2.1. Released v3.2.0.
% 0.10/0.13  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.34  % Computer : n014.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Mon May  4 22:35:36 EDT 2026
% 0.15/0.34  % CPUTime    : 
% 0.15/0.35  % start to proof: theBenchmark
% 0.24/1.62  % Version  : CSE_E---1.7
% 0.24/1.62  % Problem  : theBenchmark.p
% 0.24/1.62  % SZS status Unsatisfiable for theBenchmark.p
% 0.24/1.62  % SZS output start CNFRefutation
% See solution above
% 0.24/1.64  % Total time : 1.271s
%------------------------------------------------------------------------------