↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL899+1 : TPTP v9.2.1. Released v5.5.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 : n028.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:45:19 PM UTC 2026

% Result   : Theorem 1.27s 1.72s
% Output   : CNFRefutation 1.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   49 (  38 unt;   0 def)
%            Number of atoms       :   65 (  27 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   33 (  17   ~;  12   |;   2   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   70 (  12 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(sos_07,axiom,
    ! [X9,X10,X11] :
      ( '>='('+'(X9,X10),X11)
    <=> '>='(X10,'==>'(X9,X11)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).

fof(sos_03,axiom,
    ! [X1] : '+'(X1,'0') = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_03) ).

fof(sos_04,axiom,
    ! [X1] : '>='(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_04) ).

fof(sos_06,axiom,
    ! [X7,X8] :
      ( ( '>='(X7,X8)
        & '>='(X8,X7) )
     => X7 = X8 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_06) ).

fof(sos_08,axiom,
    ! [X1] : '>='(X1,'0'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).

fof(sos_02,axiom,
    ! [X1,X2] : '+'(X1,X2) = '+'(X2,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).

fof(sos_12,axiom,
    ! [X1] : '+'(X1,'1') = '1',
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_12) ).

fof(goals_14,conjecture,
    ! [X21] : '==>'('==>'(X21,'1'),'1') = X21,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_14) ).

fof(sos_13,axiom,
    ! [X1,X2] : '==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_13) ).

fof(c_0_9,plain,
    ! [X63,X64,X65] :
      ( ( ~ '>='('+'(X63,X64),X65)
        | '>='(X64,'==>'(X63,X65)) )
      & ( ~ '>='(X64,'==>'(X63,X65))
        | '>='('+'(X63,X64),X65) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])]) ).

fof(c_0_10,plain,
    ! [X56] : '+'(X56,'0') = X56,
    inference(variable_rename,[status(thm)],[sos_03]) ).

cnf(c_0_11,plain,
    ( '>='(X2,'==>'(X1,X3))
    | ~ '>='('+'(X1,X2),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_12,plain,
    '+'(X1,'0') = X1,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_13,plain,
    ! [X57] : '>='(X57,X57),
    inference(variable_rename,[status(thm)],[sos_04]) ).

fof(c_0_14,plain,
    ! [X61,X62] :
      ( ~ '>='(X61,X62)
      | ~ '>='(X62,X61)
      | X61 = X62 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])]) ).

cnf(c_0_15,plain,
    ( '>='('0','==>'(X1,X2))
    | ~ '>='(X1,X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    '>='(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_17,plain,
    ! [X66] : '>='(X66,'0'),
    inference(variable_rename,[status(thm)],[sos_08]) ).

fof(c_0_18,plain,
    ! [X54,X55] : '+'(X54,X55) = '+'(X55,X54),
    inference(variable_rename,[status(thm)],[sos_02]) ).

cnf(c_0_19,plain,
    ( X1 = X2
    | ~ '>='(X1,X2)
    | ~ '>='(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,plain,
    '>='('0','==>'(X1,X1)),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    '>='(X1,'0'),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_22,plain,
    '+'(X1,X2) = '+'(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_23,plain,
    ! [X76] : '+'(X76,'1') = '1',
    inference(variable_rename,[status(thm)],[sos_12]) ).

cnf(c_0_24,plain,
    ( '>='('+'(X2,X1),X3)
    | ~ '>='(X1,'==>'(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_25,plain,
    '==>'(X1,X1) = '0',
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

fof(c_0_26,negated_conjecture,
    ~ ! [X21] : '==>'('==>'(X21,'1'),'1') = X21,
    inference(assume_negation,[status(cth)],[goals_14]) ).

cnf(c_0_27,plain,
    ( '>='(X1,'==>'(X2,X3))
    | ~ '>='('+'(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_11,c_0_22]) ).

cnf(c_0_28,plain,
    '+'(X1,'1') = '1',
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_29,plain,
    '>='('+'(X1,X2),X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21])]) ).

fof(c_0_30,plain,
    ! [X77,X78] : '==>'('==>'(X77,X78),X78) = '==>'('==>'(X78,X77),X77),
    inference(variable_rename,[status(thm)],[sos_13]) ).

cnf(c_0_31,plain,
    ( '0' = X1
    | ~ '>='('0',X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_21]) ).

cnf(c_0_32,plain,
    '>='(X1,'==>'(X2,'0')),
    inference(spm,[status(thm)],[c_0_11,c_0_21]) ).

fof(c_0_33,negated_conjecture,
    '==>'('==>'(esk1_0,'1'),'1') != esk1_0,
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).

cnf(c_0_34,plain,
    ( '>='(X1,'==>'('1',X2))
    | ~ '>='('1',X2) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_35,plain,
    '>='('1',X1),
    inference(spm,[status(thm)],[c_0_29,c_0_28]) ).

cnf(c_0_36,plain,
    '==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_37,plain,
    '==>'(X1,'0') = '0',
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_38,negated_conjecture,
    '==>'('==>'(esk1_0,'1'),'1') != esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_39,plain,
    '>='(X1,'==>'('1',X2)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).

cnf(c_0_40,plain,
    '>='('+'(X1,'==>'(X1,X2)),X2),
    inference(spm,[status(thm)],[c_0_24,c_0_16]) ).

cnf(c_0_41,plain,
    '==>'('==>'('0',X1),X1) = '0',
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_42,negated_conjecture,
    '==>'('==>'('1',esk1_0),esk1_0) != esk1_0,
    inference(rw,[status(thm)],[c_0_38,c_0_36]) ).

cnf(c_0_43,plain,
    '==>'('1',X1) = '0',
    inference(spm,[status(thm)],[c_0_31,c_0_39]) ).

cnf(c_0_44,plain,
    '>='('==>'('0',X1),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_12]) ).

cnf(c_0_45,plain,
    '>='(X1,'==>'(X2,X1)),
    inference(spm,[status(thm)],[c_0_27,c_0_29]) ).

cnf(c_0_46,negated_conjecture,
    '==>'('0',esk1_0) != esk1_0,
    inference(rw,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_47,plain,
    '==>'('0',X1) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_44]),c_0_45])]) ).

cnf(c_0_48,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL899+1 : TPTP v9.2.1. Released v5.5.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.15/0.33  % Computer : n028.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Mon May  4 23:16:30 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.27/1.72  % Version  : CSE_E---1.7
% 1.27/1.72  % Problem  : theBenchmark.p
% 1.27/1.72  % SZS status Theorem for theBenchmark.p
% 1.27/1.72  % SZS output start CNFRefutation
% See solution above
% 1.27/1.72  % Total time : 1.371s
%------------------------------------------------------------------------------