↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Computer : n010.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 1.26s 1.72s
% Output   : CNFRefutation 1.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   19 (   7 unt;   0 nHn;   9 RR)
%            Number of literals    :   35 (   0 equ;  18 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    :    9 (   9 usr;   5 con; 0-3 aty)
%            Number of variables   :   50 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_PropLog_Othms__notE_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,c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms__notE_0) ).

cnf(cls_PropLog_Oweaken__left__insert_0,axiom,
    ( c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Oweaken__left__insert_0) ).

cnf(cls_PropLog_Othms_OH_0,axiom,
    ( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms_OH_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

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

cnf(cls_conjecture_1,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/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_Set_OinsertCI_1,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OinsertCI_1) ).

cnf(c_0_7,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,c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    cls_PropLog_Othms__notE_0 ).

cnf(c_0_8,axiom,
    ( c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    cls_PropLog_Oweaken__left__insert_0 ).

cnf(c_0_9,plain,
    ( c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
    | ~ c_in(X5,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X5,c_PropLog_Opl_Ofalse,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,axiom,
    ( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
    cls_PropLog_Othms_OH_0 ).

cnf(c_0_11,plain,
    ( c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X5,c_PropLog_Opl_Ofalse,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4))
    | ~ c_in(X5,c_insert(X2,X3,tc_PropLog_Opl(X4)),tc_PropLog_Opl(X4)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,negated_conjecture,
    c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    cls_conjecture_0 ).

cnf(c_0_13,axiom,
    ( c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4))
    | ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4)) ),
    cls_PropLog_Odeduction_0 ).

cnf(c_0_14,negated_conjecture,
    ( c_in(X1,c_PropLog_Othms(c_insert(X2,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
    | ~ c_in(v_p,c_insert(X2,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,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_1 ).

cnf(c_0_16,negated_conjecture,
    ( c_in(c_PropLog_Opl_Oop_A_N_62(X1,X2,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))
    | ~ c_in(v_p,c_insert(X1,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    cls_Set_OinsertCI_1 ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : LCL439-2 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33  % Computer : n010.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Mon May  4 22:35:21 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.26/1.72  % Version  : CSE_E---1.7
% 1.26/1.72  % Problem  : theBenchmark.p
% 1.26/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.72  % SZS output start CNFRefutation
% See solution above
% 1.26/1.72  % Total time : 1.368s
%------------------------------------------------------------------------------