TSTP Solution File: LCL397-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : LCL397-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n017.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:24:46 EDT 2023

% Result   : Unsatisfiable 0.19s 0.52s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   20 (  10 unt;   0 nHn;   9 RR)
%            Number of literals    :   34 (   0 equ;  16 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   36 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.lNOZhI6TnT/E---3.1_31058.p',condensed_detachment) ).

cnf(cn_1,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    file('/export/starexec/sandbox2/tmp/tmp.lNOZhI6TnT/E---3.1_31058.p',cn_1) ).

cnf(cn_2,axiom,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    file('/export/starexec/sandbox2/tmp/tmp.lNOZhI6TnT/E---3.1_31058.p',cn_2) ).

cnf(cn_3,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    file('/export/starexec/sandbox2/tmp/tmp.lNOZhI6TnT/E---3.1_31058.p',cn_3) ).

cnf(prove_cn_63,negated_conjecture,
    ~ is_a_theorem(implies(x,implies(y,y))),
    file('/export/starexec/sandbox2/tmp/tmp.lNOZhI6TnT/E---3.1_31058.p',prove_cn_63) ).

cnf(c_0_5,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    condensed_detachment ).

cnf(c_0_6,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    cn_1 ).

cnf(c_0_7,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(implies(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X3,X2))
    | ~ is_a_theorem(implies(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_7]) ).

cnf(c_0_9,axiom,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    cn_2 ).

cnf(c_0_10,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    cn_3 ).

cnf(c_0_12,plain,
    ( is_a_theorem(implies(implies(X1,X2),X2))
    | ~ is_a_theorem(implies(not(X2),X1)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_7]) ).

cnf(c_0_13,plain,
    ( is_a_theorem(implies(not(X1),X2))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_5,c_0_11]) ).

cnf(c_0_14,plain,
    ( is_a_theorem(implies(implies(X1,X2),X2))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(X3,X2)))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_14]) ).

cnf(c_0_16,negated_conjecture,
    ~ is_a_theorem(implies(x,implies(y,y))),
    prove_cn_63 ).

cnf(c_0_17,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_15,c_0_11]) ).

cnf(c_0_18,plain,
    is_a_theorem(implies(X1,X1)),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : LCL397-1 : TPTP v8.1.2. Released v2.3.0.
% 0.06/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n017.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 2400
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Oct  2 12:09:11 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.19/0.49  Running first-order model finding
% 0.19/0.49  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.lNOZhI6TnT/E---3.1_31058.p
% 0.19/0.52  # Version: 3.1pre001
% 0.19/0.52  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52  # Starting sh5l with 300s (1) cores
% 0.19/0.52  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 31180 completed with status 0
% 0.19/0.52  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.52  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.52  # No SInE strategy applied
% 0.19/0.52  # Search class: FHUNS-FFSF21-MFFFFFNN
% 0.19/0.52  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52  # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 0.19/0.52  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.52  # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 0.19/0.52  # Starting new_bool_3 with 136s (1) cores
% 0.19/0.52  # Starting new_bool_1 with 136s (1) cores
% 0.19/0.52  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 31186 completed with status 0
% 0.19/0.52  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.52  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.52  # No SInE strategy applied
% 0.19/0.52  # Search class: FHUNS-FFSF21-MFFFFFNN
% 0.19/0.52  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52  # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 0.19/0.52  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.52  # Preprocessing time       : 0.002 s
% 0.19/0.52  
% 0.19/0.52  # Proof found!
% 0.19/0.52  # SZS status Unsatisfiable
% 0.19/0.52  # SZS output start CNFRefutation
% See solution above
% 0.19/0.52  # Parsed axioms                        : 5
% 0.19/0.52  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.52  # Initial clauses                      : 5
% 0.19/0.52  # Removed in clause preprocessing      : 0
% 0.19/0.52  # Initial clauses in saturation        : 5
% 0.19/0.52  # Processed clauses                    : 30
% 0.19/0.52  # ...of these trivial                  : 0
% 0.19/0.52  # ...subsumed                          : 5
% 0.19/0.52  # ...remaining for further processing  : 25
% 0.19/0.52  # Other redundant clauses eliminated   : 0
% 0.19/0.52  # Clauses deleted for lack of memory   : 0
% 0.19/0.52  # Backward-subsumed                    : 2
% 0.19/0.52  # Backward-rewritten                   : 0
% 0.19/0.52  # Generated clauses                    : 93
% 0.19/0.52  # ...of the previous two non-redundant : 74
% 0.19/0.52  # ...aggressively subsumed             : 0
% 0.19/0.52  # Contextual simplify-reflections      : 0
% 0.19/0.52  # Paramodulations                      : 93
% 0.19/0.52  # Factorizations                       : 0
% 0.19/0.52  # NegExts                              : 0
% 0.19/0.52  # Equation resolutions                 : 0
% 0.19/0.52  # Total rewrite steps                  : 3
% 0.19/0.52  # Propositional unsat checks           : 0
% 0.19/0.52  #    Propositional check models        : 0
% 0.19/0.52  #    Propositional check unsatisfiable : 0
% 0.19/0.52  #    Propositional clauses             : 0
% 0.19/0.52  #    Propositional clauses after purity: 0
% 0.19/0.52  #    Propositional unsat core size     : 0
% 0.19/0.52  #    Propositional preprocessing time  : 0.000
% 0.19/0.52  #    Propositional encoding time       : 0.000
% 0.19/0.52  #    Propositional solver time         : 0.000
% 0.19/0.52  #    Success case prop preproc time    : 0.000
% 0.19/0.52  #    Success case prop encoding time   : 0.000
% 0.19/0.52  #    Success case prop solver time     : 0.000
% 0.19/0.52  # Current number of processed clauses  : 23
% 0.19/0.52  #    Positive orientable unit clauses  : 5
% 0.19/0.52  #    Positive unorientable unit clauses: 0
% 0.19/0.52  #    Negative unit clauses             : 1
% 0.19/0.52  #    Non-unit-clauses                  : 17
% 0.19/0.52  # Current number of unprocessed clauses: 49
% 0.19/0.52  # ...number of literals in the above   : 120
% 0.19/0.52  # Current number of archived formulas  : 0
% 0.19/0.52  # Current number of archived clauses   : 2
% 0.19/0.52  # Clause-clause subsumption calls (NU) : 105
% 0.19/0.52  # Rec. Clause-clause subsumption calls : 103
% 0.19/0.52  # Non-unit clause-clause subsumptions  : 7
% 0.19/0.52  # Unit Clause-clause subsumption calls : 6
% 0.19/0.52  # Rewrite failures with RHS unbound    : 0
% 0.19/0.52  # BW rewrite match attempts            : 22
% 0.19/0.52  # BW rewrite match successes           : 0
% 0.19/0.52  # Condensation attempts                : 0
% 0.19/0.52  # Condensation successes               : 0
% 0.19/0.52  # Termbank termtop insertions          : 1359
% 0.19/0.52  
% 0.19/0.52  # -------------------------------------------------
% 0.19/0.52  # User time                : 0.006 s
% 0.19/0.52  # System time              : 0.005 s
% 0.19/0.52  # Total time               : 0.011 s
% 0.19/0.52  # Maximum resident set size: 1640 pages
% 0.19/0.52  
% 0.19/0.52  # -------------------------------------------------
% 0.19/0.52  # User time                : 0.030 s
% 0.19/0.52  # System time              : 0.015 s
% 0.19/0.52  # Total time               : 0.045 s
% 0.19/0.52  # Maximum resident set size: 1676 pages
% 0.19/0.52  % E---3.1 exiting
%------------------------------------------------------------------------------