TSTP Solution File: LCL190-3 by E---3.1

View Problem - Process Solution

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

% Computer : n016.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:11:53 EDT 2023

% Result   : Unsatisfiable 0.15s 0.42s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (   9 unt;   0 nHn;   7 RR)
%            Number of literals    :   21 (   0 equ;   9 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_1,axiom,
    ( theorem(X1)
    | ~ axiom(X1) ),
    file('/export/starexec/sandbox/tmp/tmp.HyytmNhTj4/E---3.1_22526.p',rule_1) ).

cnf(axiom_1_6,axiom,
    axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
    file('/export/starexec/sandbox/tmp/tmp.HyytmNhTj4/E---3.1_22526.p',axiom_1_6) ).

cnf(rule_2,axiom,
    ( theorem(X1)
    | ~ theorem(implies(X2,X1))
    | ~ theorem(X2) ),
    file('/export/starexec/sandbox/tmp/tmp.HyytmNhTj4/E---3.1_22526.p',rule_2) ).

cnf(axiom_1_4,axiom,
    axiom(implies(or(X1,X2),or(X2,X1))),
    file('/export/starexec/sandbox/tmp/tmp.HyytmNhTj4/E---3.1_22526.p',axiom_1_4) ).

cnf(prove_this,negated_conjecture,
    ~ theorem(implies(or(p,or(q,r)),or(p,or(r,q)))),
    file('/export/starexec/sandbox/tmp/tmp.HyytmNhTj4/E---3.1_22526.p',prove_this) ).

cnf(c_0_5,axiom,
    ( theorem(X1)
    | ~ axiom(X1) ),
    rule_1 ).

cnf(c_0_6,axiom,
    axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
    axiom_1_6 ).

cnf(c_0_7,axiom,
    ( theorem(X1)
    | ~ theorem(implies(X2,X1))
    | ~ theorem(X2) ),
    rule_2 ).

cnf(c_0_8,plain,
    theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
    inference(pm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,axiom,
    axiom(implies(or(X1,X2),or(X2,X1))),
    axiom_1_4 ).

cnf(c_0_10,negated_conjecture,
    ~ theorem(implies(or(p,or(q,r)),or(p,or(r,q)))),
    prove_this ).

cnf(c_0_11,plain,
    ( theorem(implies(or(X1,X2),or(X1,X3)))
    | ~ theorem(implies(X2,X3)) ),
    inference(pm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    theorem(implies(or(X1,X2),or(X2,X1))),
    inference(pm,[status(thm)],[c_0_5,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : LCL190-3 : TPTP v8.1.2. Released v2.3.0.
% 0.10/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n016.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 2400
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Mon Oct  2 13:01:36 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  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.HyytmNhTj4/E---3.1_22526.p
% 0.15/0.42  # Version: 3.1pre001
% 0.15/0.42  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42  # Starting sh5l with 300s (1) cores
% 0.15/0.42  # new_bool_3 with pid 22605 completed with status 0
% 0.15/0.42  # Result found by new_bool_3
% 0.15/0.42  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42  # Search class: FHUNM-FFSF22-MFFFFFNN
% 0.15/0.42  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42  # Starting G-E--_300_C01_S5PRR_S00 with 181s (1) cores
% 0.15/0.42  # G-E--_300_C01_S5PRR_S00 with pid 22609 completed with status 0
% 0.15/0.42  # Result found by G-E--_300_C01_S5PRR_S00
% 0.15/0.42  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42  # Search class: FHUNM-FFSF22-MFFFFFNN
% 0.15/0.42  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42  # Starting G-E--_300_C01_S5PRR_S00 with 181s (1) cores
% 0.15/0.42  # Preprocessing time       : 0.001 s
% 0.15/0.42  
% 0.15/0.42  # Proof found!
% 0.15/0.42  # SZS status Unsatisfiable
% 0.15/0.42  # SZS output start CNFRefutation
% See solution above
% 0.15/0.42  # Parsed axioms                        : 9
% 0.15/0.42  # Removed by relevancy pruning/SinE    : 1
% 0.15/0.42  # Initial clauses                      : 8
% 0.15/0.42  # Removed in clause preprocessing      : 0
% 0.15/0.42  # Initial clauses in saturation        : 8
% 0.15/0.42  # Processed clauses                    : 19
% 0.15/0.42  # ...of these trivial                  : 0
% 0.15/0.42  # ...subsumed                          : 1
% 0.15/0.42  # ...remaining for further processing  : 18
% 0.15/0.42  # Other redundant clauses eliminated   : 0
% 0.15/0.42  # Clauses deleted for lack of memory   : 0
% 0.15/0.42  # Backward-subsumed                    : 0
% 0.15/0.42  # Backward-rewritten                   : 0
% 0.15/0.42  # Generated clauses                    : 17
% 0.15/0.42  # ...of the previous two non-redundant : 13
% 0.15/0.42  # ...aggressively subsumed             : 0
% 0.15/0.42  # Contextual simplify-reflections      : 0
% 0.15/0.42  # Paramodulations                      : 17
% 0.15/0.42  # Factorizations                       : 0
% 0.15/0.42  # NegExts                              : 0
% 0.15/0.42  # Equation resolutions                 : 0
% 0.15/0.42  # Total rewrite steps                  : 1
% 0.15/0.42  # Propositional unsat checks           : 0
% 0.15/0.42  #    Propositional check models        : 0
% 0.15/0.42  #    Propositional check unsatisfiable : 0
% 0.15/0.42  #    Propositional clauses             : 0
% 0.15/0.42  #    Propositional clauses after purity: 0
% 0.15/0.42  #    Propositional unsat core size     : 0
% 0.15/0.42  #    Propositional preprocessing time  : 0.000
% 0.15/0.42  #    Propositional encoding time       : 0.000
% 0.15/0.42  #    Propositional solver time         : 0.000
% 0.15/0.42  #    Success case prop preproc time    : 0.000
% 0.15/0.42  #    Success case prop encoding time   : 0.000
% 0.15/0.42  #    Success case prop solver time     : 0.000
% 0.15/0.42  # Current number of processed clauses  : 18
% 0.15/0.42  #    Positive orientable unit clauses  : 10
% 0.15/0.42  #    Positive unorientable unit clauses: 0
% 0.15/0.42  #    Negative unit clauses             : 1
% 0.15/0.42  #    Non-unit-clauses                  : 7
% 0.15/0.42  # Current number of unprocessed clauses: 1
% 0.15/0.42  # ...number of literals in the above   : 2
% 0.15/0.42  # Current number of archived formulas  : 0
% 0.15/0.42  # Current number of archived clauses   : 0
% 0.15/0.42  # Clause-clause subsumption calls (NU) : 9
% 0.15/0.42  # Rec. Clause-clause subsumption calls : 9
% 0.15/0.42  # Non-unit clause-clause subsumptions  : 1
% 0.15/0.42  # Unit Clause-clause subsumption calls : 0
% 0.15/0.42  # Rewrite failures with RHS unbound    : 0
% 0.15/0.42  # BW rewrite match attempts            : 6
% 0.15/0.42  # BW rewrite match successes           : 0
% 0.15/0.42  # Condensation attempts                : 0
% 0.15/0.42  # Condensation successes               : 0
% 0.15/0.42  # Termbank termtop insertions          : 360
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.002 s
% 0.15/0.42  # System time              : 0.001 s
% 0.15/0.42  # Total time               : 0.003 s
% 0.15/0.42  # Maximum resident set size: 1648 pages
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.004 s
% 0.15/0.42  # System time              : 0.002 s
% 0.15/0.42  # Total time               : 0.006 s
% 0.15/0.42  # Maximum resident set size: 1680 pages
% 0.15/0.42  % E---3.1 exiting
% 0.15/0.42  % E---3.1 exiting
%------------------------------------------------------------------------------