TSTP Solution File: KLE005+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : KLE005+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n024.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 18:04:34 EDT 2023

% Result   : Theorem 0.21s 0.50s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   20 (   8 unt;   0 def)
%            Number of atoms       :   48 (  25 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   47 (  19   ~;  17   |;   6   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   21 (   0 sgn;  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(test_3,axiom,
    ! [X4,X5] :
      ( test(X4)
     => ( c(X4) = X5
      <=> complement(X4,X5) ) ),
    file('/export/starexec/sandbox/tmp/tmp.mznGFMUlrv/E---3.1_8189.p',test_3) ).

fof(test_4,axiom,
    ! [X4] :
      ( ~ test(X4)
     => c(X4) = zero ),
    file('/export/starexec/sandbox/tmp/tmp.mznGFMUlrv/E---3.1_8189.p',test_4) ).

fof(test_2,axiom,
    ! [X4,X5] :
      ( complement(X5,X4)
    <=> ( multiplication(X4,X5) = zero
        & multiplication(X5,X4) = zero
        & addition(X4,X5) = one ) ),
    file('/export/starexec/sandbox/tmp/tmp.mznGFMUlrv/E---3.1_8189.p',test_2) ).

fof(goals,conjecture,
    c(one) = zero,
    file('/export/starexec/sandbox/tmp/tmp.mznGFMUlrv/E---3.1_8189.p',goals) ).

fof(multiplicative_left_identity,axiom,
    ! [X1] : multiplication(one,X1) = X1,
    file('/export/starexec/sandbox/tmp/tmp.mznGFMUlrv/E---3.1_8189.p',multiplicative_left_identity) ).

fof(c_0_5,plain,
    ! [X9,X10] :
      ( ( c(X9) != X10
        | complement(X9,X10)
        | ~ test(X9) )
      & ( ~ complement(X9,X10)
        | c(X9) = X10
        | ~ test(X9) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).

fof(c_0_6,plain,
    ! [X4] :
      ( ~ test(X4)
     => c(X4) = zero ),
    inference(fof_simplification,[status(thm)],[test_4]) ).

fof(c_0_7,plain,
    ! [X14,X15] :
      ( ( multiplication(X14,X15) = zero
        | ~ complement(X15,X14) )
      & ( multiplication(X15,X14) = zero
        | ~ complement(X15,X14) )
      & ( addition(X14,X15) = one
        | ~ complement(X15,X14) )
      & ( multiplication(X14,X15) != zero
        | multiplication(X15,X14) != zero
        | addition(X14,X15) != one
        | complement(X15,X14) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).

cnf(c_0_8,plain,
    ( complement(X1,X2)
    | c(X1) != X2
    | ~ test(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_9,negated_conjecture,
    c(one) != zero,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).

fof(c_0_10,plain,
    ! [X11] :
      ( test(X11)
      | c(X11) = zero ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).

fof(c_0_11,plain,
    ! [X13] : multiplication(one,X13) = X13,
    inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).

cnf(c_0_12,plain,
    ( multiplication(X1,X2) = zero
    | ~ complement(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,plain,
    ( complement(X1,c(X1))
    | ~ test(X1) ),
    inference(er,[status(thm)],[c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    c(one) != zero,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    ( test(X1)
    | c(X1) = zero ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,plain,
    multiplication(one,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,plain,
    ( multiplication(X1,c(X1)) = zero
    | ~ test(X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    test(one),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : KLE005+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.15/0.35  % Computer : n024.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 2400
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Tue Oct  3 04:43:41 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 0.21/0.48  Running first-order model finding
% 0.21/0.48  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.mznGFMUlrv/E---3.1_8189.p
% 0.21/0.50  # Version: 3.1pre001
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # Starting sh5l with 300s (1) cores
% 0.21/0.50  # new_bool_1 with pid 8345 completed with status 0
% 0.21/0.50  # Result found by new_bool_1
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50  # Search class: FGUSM-FFSF21-SFFFFFNN
% 0.21/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50  # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.50  # G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 8350 completed with status 0
% 0.21/0.50  # Result found by G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50  # Search class: FGUSM-FFSF21-SFFFFFNN
% 0.21/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50  # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.50  # Preprocessing time       : 0.001 s
% 0.21/0.50  # Presaturation interreduction done
% 0.21/0.50  
% 0.21/0.50  # Proof found!
% 0.21/0.50  # SZS status Theorem
% 0.21/0.50  # SZS output start CNFRefutation
% See solution above
% 0.21/0.50  # Parsed axioms                        : 17
% 0.21/0.50  # Removed by relevancy pruning/SinE    : 1
% 0.21/0.50  # Initial clauses                      : 21
% 0.21/0.50  # Removed in clause preprocessing      : 0
% 0.21/0.50  # Initial clauses in saturation        : 21
% 0.21/0.50  # Processed clauses                    : 38
% 0.21/0.50  # ...of these trivial                  : 0
% 0.21/0.50  # ...subsumed                          : 0
% 0.21/0.50  # ...remaining for further processing  : 38
% 0.21/0.50  # Other redundant clauses eliminated   : 1
% 0.21/0.50  # Clauses deleted for lack of memory   : 0
% 0.21/0.50  # Backward-subsumed                    : 0
% 0.21/0.50  # Backward-rewritten                   : 0
% 0.21/0.50  # Generated clauses                    : 10
% 0.21/0.50  # ...of the previous two non-redundant : 6
% 0.21/0.50  # ...aggressively subsumed             : 0
% 0.21/0.50  # Contextual simplify-reflections      : 0
% 0.21/0.50  # Paramodulations                      : 9
% 0.21/0.50  # Factorizations                       : 0
% 0.21/0.50  # NegExts                              : 0
% 0.21/0.50  # Equation resolutions                 : 1
% 0.21/0.50  # Total rewrite steps                  : 1
% 0.21/0.50  # Propositional unsat checks           : 0
% 0.21/0.50  #    Propositional check models        : 0
% 0.21/0.50  #    Propositional check unsatisfiable : 0
% 0.21/0.50  #    Propositional clauses             : 0
% 0.21/0.50  #    Propositional clauses after purity: 0
% 0.21/0.50  #    Propositional unsat core size     : 0
% 0.21/0.50  #    Propositional preprocessing time  : 0.000
% 0.21/0.50  #    Propositional encoding time       : 0.000
% 0.21/0.50  #    Propositional solver time         : 0.000
% 0.21/0.50  #    Success case prop preproc time    : 0.000
% 0.21/0.50  #    Success case prop encoding time   : 0.000
% 0.21/0.50  #    Success case prop solver time     : 0.000
% 0.21/0.50  # Current number of processed clauses  : 16
% 0.21/0.50  #    Positive orientable unit clauses  : 7
% 0.21/0.50  #    Positive unorientable unit clauses: 0
% 0.21/0.50  #    Negative unit clauses             : 1
% 0.21/0.50  #    Non-unit-clauses                  : 8
% 0.21/0.50  # Current number of unprocessed clauses: 10
% 0.21/0.50  # ...number of literals in the above   : 18
% 0.21/0.50  # Current number of archived formulas  : 0
% 0.21/0.50  # Current number of archived clauses   : 21
% 0.21/0.50  # Clause-clause subsumption calls (NU) : 9
% 0.21/0.50  # Rec. Clause-clause subsumption calls : 9
% 0.21/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.50  # Unit Clause-clause subsumption calls : 0
% 0.21/0.50  # Rewrite failures with RHS unbound    : 0
% 0.21/0.50  # BW rewrite match attempts            : 9
% 0.21/0.50  # BW rewrite match successes           : 6
% 0.21/0.50  # Condensation attempts                : 0
% 0.21/0.50  # Condensation successes               : 0
% 0.21/0.50  # Termbank termtop insertions          : 978
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.005 s
% 0.21/0.50  # System time              : 0.004 s
% 0.21/0.50  # Total time               : 0.009 s
% 0.21/0.50  # Maximum resident set size: 1776 pages
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.006 s
% 0.21/0.50  # System time              : 0.007 s
% 0.21/0.50  # Total time               : 0.013 s
% 0.21/0.50  # Maximum resident set size: 1692 pages
% 0.21/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------