↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL414+1 : TPTP v9.2.1. Released v2.5.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 : n015.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:17 PM UTC 2026

% Result   : Theorem 0.43s 1.61s
% Output   : CNFRefutation 0.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   32 (  19 unt;   0 def)
%            Number of atoms       :   69 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   71 (  34   ~;  25   |;  12   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   84 (   6 sgn  27   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thm147,conjecture,
    ~ ( ! [X1,X2] :
          ( ~ a_truth(implies(X1,X2))
          | ~ a_truth(X1)
          | a_truth(X2) )
      & ! [X1,X2] : a_truth(implies(X1,implies(X2,X1)))
      & ! [X1,X2,X3] : a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3))))
      & ! [X1,X2] : a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1)))
      & ? [X4] : ~ a_truth(implies(X4,X4)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm147) ).

fof(i_0_1,negated_conjecture,
    ~ ~ ( ! [X1,X2] :
            ( ~ a_truth(implies(X1,X2))
            | ~ a_truth(X1)
            | a_truth(X2) )
        & ! [X1,X2] : a_truth(implies(X1,implies(X2,X1)))
        & ! [X1,X2,X3] : a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3))))
        & ! [X1,X2] : a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1)))
        & ? [X4] : ~ a_truth(implies(X4,X4)) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thm147])]) ).

fof(i_0_2,negated_conjecture,
    ! [X15,X16,X17,X18,X19,X20,X21,X22,X23] :
      ( ( ~ a_truth(implies(X15,X16))
        | ~ a_truth(X15)
        | a_truth(X16) )
      & a_truth(implies(X17,implies(X18,X17)))
      & a_truth(implies(implies(X19,implies(X20,X21)),implies(implies(X19,X20),implies(X19,X21))))
      & a_truth(implies(implies(not(X22),not(X23)),implies(X23,X22)))
      & ~ a_truth(implies(esk1_0,esk1_0)) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_1])])])]) ).

cnf(i_0_3,negated_conjecture,
    a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_4,negated_conjecture,
    a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1))),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_5,negated_conjecture,
    a_truth(implies(X1,implies(X2,X1))),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_6,negated_conjecture,
    ( a_truth(X2)
    | ~ a_truth(implies(X1,X2))
    | ~ a_truth(X1) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_7,negated_conjecture,
    ~ a_truth(implies(esk1_0,esk1_0)),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_8,plain,
    ~ a_truth(implies(not(esk1_0),not(esk1_0))),
    inference(scs_inference,[],[i_0_7,i_0_4,i_0_6]) ).

cnf(i_0_9,plain,
    a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1))),
    inference(rename_variables,[],[i_0_4]) ).

cnf(i_0_10,plain,
    ( ~ a_truth(implies(X1,X2))
    | ~ a_truth(X1)
    | a_truth(X2) ),
    inference(rename_variables,[],[i_0_6]) ).

cnf(i_0_11,plain,
    a_truth(implies(implies(X1,X2),implies(X1,X1))),
    inference(scs_inference,[],[i_0_3,i_0_5,i_0_6]) ).

cnf(i_0_12,plain,
    a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
    inference(rename_variables,[],[i_0_3]) ).

cnf(i_0_13,plain,
    ( ~ a_truth(implies(X1,X2))
    | ~ a_truth(X1)
    | a_truth(X2) ),
    inference(rename_variables,[],[i_0_6]) ).

cnf(i_0_14,plain,
    a_truth(implies(implies(implies(X1,X2),X1),implies(implies(X1,X2),X1))),
    inference(scs_inference,[],[i_0_3,i_0_11,i_0_6]) ).

cnf(i_0_15,plain,
    a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
    inference(rename_variables,[],[i_0_3]) ).

cnf(i_0_16,plain,
    ( ~ a_truth(implies(X1,X2))
    | ~ a_truth(X1)
    | a_truth(X2) ),
    inference(rename_variables,[],[i_0_6]) ).

cnf(i_0_17,plain,
    a_truth(implies(implies(X1,implies(X2,X3)),implies(X1,implies(X2,X3)))),
    inference(scs_inference,[],[i_0_3,i_0_11,i_0_6]) ).

cnf(i_0_18,plain,
    a_truth(implies(implies(X1,X2),implies(X1,X1))),
    inference(rename_variables,[],[i_0_11]) ).

cnf(i_0_19,plain,
    ( ~ a_truth(implies(X1,X2))
    | ~ a_truth(X1)
    | a_truth(X2) ),
    inference(rename_variables,[],[i_0_6]) ).

cnf(i_0_20,plain,
    ~ a_truth(implies(not(not(esk1_0)),not(not(esk1_0)))),
    inference(scs_inference,[],[i_0_8,i_0_4,i_0_6]) ).

cnf(i_0_21,plain,
    a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1))),
    inference(rename_variables,[],[i_0_4]) ).

cnf(i_0_22,plain,
    ( ~ a_truth(implies(X1,X2))
    | ~ a_truth(X1)
    | a_truth(X2) ),
    inference(rename_variables,[],[i_0_6]) ).

cnf(i_0_23,plain,
    ( ~ a_truth(implies(implies(X1,X2),X1))
    | a_truth(implies(implies(X1,X2),X1)) ),
    inference(scs_inference,[],[i_0_14,i_0_6]) ).

cnf(i_0_24,plain,
    ( ~ a_truth(implies(X1,X2))
    | ~ a_truth(X1)
    | a_truth(X2) ),
    inference(rename_variables,[],[i_0_6]) ).

cnf(i_0_25,plain,
    a_truth(implies(X1,implies(implies(not(X2),not(X3)),implies(X3,X2)))),
    inference(scs_inference,[],[i_0_4,i_0_5,i_0_6]) ).

cnf(i_0_26,plain,
    a_truth(implies(X1,implies(X2,X1))),
    inference(rename_variables,[],[i_0_5]) ).

cnf(i_0_27,plain,
    ( ~ a_truth(implies(X1,X2))
    | ~ a_truth(X1)
    | a_truth(X2) ),
    inference(rename_variables,[],[i_0_6]) ).

cnf(i_0_28,plain,
    a_truth(implies(implies(not(X1),not(X2)),implies(not(X1),not(X2)))),
    inference(scs_inference,[],[i_0_4,i_0_11,i_0_6]) ).

cnf(i_0_29,plain,
    a_truth(implies(implies(X1,X2),implies(X1,X1))),
    inference(rename_variables,[],[i_0_11]) ).

cnf(i_0_30,plain,
    ( ~ a_truth(implies(X1,X2))
    | ~ a_truth(X1)
    | a_truth(X2) ),
    inference(rename_variables,[],[i_0_6]) ).

cnf(i_0_31,plain,
    $false,
    inference(scs_inference,[],[i_0_5,i_0_20,i_0_11,i_0_6]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL414+1 : TPTP v9.2.1. Released v2.5.0.
% 0.00/0.12  % 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.33  % Computer : n015.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 22:32:32 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 0.43/1.61  % Version  : CSE_E---1.7
% 0.43/1.61  % Problem  : theBenchmark.p
% 0.43/1.61  % SZS status Theorem for theBenchmark.p
% 0.43/1.61  % SZS output start CNFRefutation
% See solution above
% 0.43/1.65  % Total time : 1.269s
%------------------------------------------------------------------------------