TSTP Solution File: SYN234-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SYN234-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n006.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 20:14:09 EDT 2023

% Result   : Timeout 0.40s 300.06s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   18 (  11 unt;   0 nHn;  18 RR)
%            Number of literals    :   29 (   0 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   13 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_021,axiom,
    ( m1(X1,X2,X1)
    | ~ l0(X1)
    | ~ k0(X2) ),
    file('/export/starexec/sandbox/tmp/tmp.WaOtw0nz78/E---3.1_27128.p',rule_021) ).

cnf(axiom_28,axiom,
    k0(e),
    file('/export/starexec/sandbox/tmp/tmp.WaOtw0nz78/E---3.1_27128.p',axiom_28) ).

cnf(axiom_20,axiom,
    l0(a),
    file('/export/starexec/sandbox/tmp/tmp.WaOtw0nz78/E---3.1_27128.p',axiom_20) ).

cnf(rule_176,axiom,
    ( p2(X1,X2,X1)
    | ~ m1(X2,X1,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.WaOtw0nz78/E---3.1_27128.p',rule_176) ).

cnf(rule_215,axiom,
    ( l3(X1,X2)
    | ~ r0(X1)
    | ~ p2(X1,X2,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.WaOtw0nz78/E---3.1_27128.p',rule_215) ).

cnf(axiom_13,axiom,
    r0(e),
    file('/export/starexec/sandbox/tmp/tmp.WaOtw0nz78/E---3.1_27128.p',axiom_13) ).

cnf(prove_this,negated_conjecture,
    ~ l3(e,a),
    file('/export/starexec/sandbox/tmp/tmp.WaOtw0nz78/E---3.1_27128.p',prove_this) ).

cnf(c_0_7,axiom,
    ( m1(X1,X2,X1)
    | ~ l0(X1)
    | ~ k0(X2) ),
    rule_021 ).

cnf(c_0_8,axiom,
    k0(e),
    axiom_28 ).

cnf(c_0_9,plain,
    ( m1(X1,e,X1)
    | ~ l0(X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,axiom,
    l0(a),
    axiom_20 ).

cnf(c_0_11,axiom,
    ( p2(X1,X2,X1)
    | ~ m1(X2,X1,X2) ),
    rule_176 ).

cnf(c_0_12,plain,
    m1(a,e,a),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,axiom,
    ( l3(X1,X2)
    | ~ r0(X1)
    | ~ p2(X1,X2,X1) ),
    rule_215 ).

cnf(c_0_14,plain,
    p2(e,a,e),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,axiom,
    r0(e),
    axiom_13 ).

cnf(c_0_16,negated_conjecture,
    ~ l3(e,a),
    prove_this ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08  % Problem    : SYN234-1 : TPTP v8.1.2. Released v1.1.0.
% 0.04/0.09  % Command    : run_E %s %d THM
% 0.08/0.28  % Computer : n006.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit   : 2400
% 0.08/0.28  % WCLimit    : 300
% 0.08/0.28  % DateTime   : Mon Oct  2 18:21:54 EDT 2023
% 0.08/0.28  % CPUTime    : 
% 0.12/0.37  Running first-order theorem proving
% 0.12/0.37  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.WaOtw0nz78/E---3.1_27128.p
% 0.40/300.06  # Version: 3.1pre001
% 0.40/300.06  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.40/300.06  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/300.06  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.40/300.06  # Starting new_bool_3 with 300s (1) cores
% 0.40/300.06  # Starting new_bool_1 with 300s (1) cores
% 0.40/300.06  # Starting sh5l with 300s (1) cores
% 0.40/300.06  # new_bool_3 with pid 27211 completed with status 0
% 0.40/300.06  # Result found by new_bool_3
% 0.40/300.06  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.40/300.06  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/300.06  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.40/300.06  # Starting new_bool_3 with 300s (1) cores
% 0.40/300.06  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/300.06  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.40/300.06  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/300.06  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.40/300.06  # SAT001_MinMin_p005000_rr_RG with pid 27220 completed with status 0
% 0.40/300.06  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.40/300.06  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.40/300.06  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/300.06  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.40/300.06  # Starting new_bool_3 with 300s (1) cores
% 0.40/300.06  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/300.06  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.40/300.06  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/300.06  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.40/300.06  # Preprocessing time       : 0.003 s
% 0.40/300.06  # Presaturation interreduction done
% 0.40/300.06  
% 0.40/300.06  # Proof found!
% 0.40/300.06  # SZS status Unsatisfiable
% 0.40/300.06  # SZS output start CNFRefutation
% See solution above
% 0.40/300.06  # Parsed axioms                        : 369
% 0.40/300.06  # Removed by relevancy pruning/SinE    : 30
% 0.40/300.06  # Initial clauses                      : 339
% 0.40/300.06  # Removed in clause preprocessing      : 6
% 0.40/300.06  # Initial clauses in saturation        : 333
% 0.40/300.06  # Processed clauses                    : 612
% 0.40/300.06  # ...of these trivial                  : 14
% 0.40/300.06  # ...subsumed                          : 23
% 0.40/300.06  # ...remaining for further processing  : 575
% 0.40/300.06  # Other redundant clauses eliminated   : 0
% 0.40/300.06  # Clauses deleted for lack of memory   : 0
% 0.40/300.06  # Backward-subsumed                    : 7
% 0.40/300.06  # Backward-rewritten                   : 26
% 0.40/300.06  # Generated clauses                    : 306
% 0.40/300.06  # ...of the previous two non-redundant : 196
% 0.40/300.06  # ...aggressively subsumed             : 0
% 0.40/300.06  # Contextual simplify-reflections      : 2
% 0.40/300.06  # Paramodulations                      : 306
% 0.40/300.06  # Factorizations                       : 0
% 0.40/300.06  # NegExts                              : 0
% 0.40/300.06  # Equation resolutions                 : 0
% 0.40/300.06  # Total rewrite steps                  : 228
% 0.40/300.06  # Propositional unsat checks           : 0
% 0.40/300.06  #    Propositional check models        : 0
% 0.40/300.06  #    Propositional check unsatisfiable : 0
% 0.40/300.06  #    Propositional clauses             : 0
% 0.40/300.06  #    Propositional clauses after purity: 0
% 0.40/300.06  #    Propositional unsat core size     : 0
% 0.40/300.06  #    Propositional preprocessing time  : 0.000
% 0.40/300.06  #    Propositional encoding time       : 0.000
% 0.40/300.06  #    Propositional solver time         : 0.000
% 0.40/300.06  #    Success case prop preproc time    : 0.000
% 0.40/300.06  #    Success case prop encoding time   : 0.000
% 0.40/300.06  #    Success case prop solver time     : 0.000
% 0.40/300.06  # Current number of processed clauses  : 243
% 0.40/300.06  #    Positive orientable unit clauses  : 106
% 0.40/300.06  #    Positive unorientable unit clauses: 0
% 0.40/300.06  #    Negative unit clauses             : 1
% 0.40/300.06  #    Non-unit-clauses                  : 136
% 0.40/300.06  # Current number of unprocessed clauses: 209
% 0.40/300.06  # ...number of literals in the above   : 579
% 0.40/300.06  # Current number of archived formulas  : 0
% 0.40/300.06  # Current number of archived clauses   : 332
% 0.40/300.06  # Clause-clause subsumption calls (NU) : 22937
% 0.40/300.06  # Rec. Clause-clause subsumption calls : 15879
% 0.40/300.06  # Non-unit clause-clause subsumptions  : 31
% 0.40/300.06  # Unit Clause-clause subsumption calls : 167
% 0.40/300.06  # Rewrite failures with RHS unbound    : 0
% 0.40/300.06  # BW rewrite match attempts            : 33
% 0.40/300.06  # BW rewrite match successes           : 25
% 0.40/300.06  # Condensation attempts                : 0
% 0.40/300.06  # Condensation successes               : 0
% 0.40/300.06  # Termbank termtop insertions          : 11825
% 0.40/300.06  
% 0.40/300.06  # -------------------------------------------------
% 0.40/300.06  # User time                : 0.021 s
% 0.40/300.06  # System time              : 0.008 s
% 0.40/300.06  # Total time               : 0.029 s
% 0.40/300.06  # Maximum resident set size: 2600 pages
% 0.40/300.06  
% 0.40/300.06  # -------------------------------------------------
% 0.40/300.06  # User time                : 0.025 s
% 0.40/300.06  # System time              : 0.008 s
% 0.40/300.06  # Total time               : 0.034 s
% 0.40/300.06  # Maximum resident set size: 2000 pages
% 0.40/300.06  % E---3.1 exiting
% 0.40/300.06  % E---3.1 exiting
%------------------------------------------------------------------------------