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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : LCL186-1 : TPTP v8.1.2. Released v1.1.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:03 EDT 2023

% Result   : Unsatisfiable 0.18s 0.47s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (   8 unt;   0 nHn;   9 RR)
%            Number of literals    :   23 (   0 equ;  11 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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   24 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_3,axiom,
    ( theorem(or(not(X1),X2))
    | ~ axiom(or(not(X1),X3))
    | ~ theorem(or(not(X3),X2)) ),
    file('/export/starexec/sandbox2/tmp/tmp.AhSLgKpN5Y/E---3.1_7995.p',rule_3) ).

cnf(rule_1,axiom,
    ( theorem(X1)
    | ~ axiom(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.AhSLgKpN5Y/E---3.1_7995.p',rule_1) ).

cnf(axiom_1_3,axiom,
    axiom(or(not(X1),or(X2,X1))),
    file('/export/starexec/sandbox2/tmp/tmp.AhSLgKpN5Y/E---3.1_7995.p',axiom_1_3) ).

cnf(axiom_1_4,axiom,
    axiom(or(not(or(X1,X2)),or(X2,X1))),
    file('/export/starexec/sandbox2/tmp/tmp.AhSLgKpN5Y/E---3.1_7995.p',axiom_1_4) ).

cnf(prove_this,negated_conjecture,
    ~ theorem(or(not(not(p)),or(not(p),q))),
    file('/export/starexec/sandbox2/tmp/tmp.AhSLgKpN5Y/E---3.1_7995.p',prove_this) ).

cnf(c_0_5,axiom,
    ( theorem(or(not(X1),X2))
    | ~ axiom(or(not(X1),X3))
    | ~ theorem(or(not(X3),X2)) ),
    rule_3 ).

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

cnf(c_0_7,plain,
    ( theorem(or(not(X1),X2))
    | ~ axiom(or(not(X1),X3))
    | ~ axiom(or(not(X3),X2)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,axiom,
    axiom(or(not(X1),or(X2,X1))),
    axiom_1_3 ).

cnf(c_0_9,plain,
    ( theorem(or(not(X1),X2))
    | ~ axiom(or(not(or(X3,X1)),X2)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,axiom,
    axiom(or(not(or(X1,X2)),or(X2,X1))),
    axiom_1_4 ).

cnf(c_0_11,negated_conjecture,
    ~ theorem(or(not(not(p)),or(not(p),q))),
    prove_this ).

cnf(c_0_12,plain,
    theorem(or(not(X1),or(X1,X2))),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : LCL186-1 : TPTP v8.1.2. Released v1.1.0.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n017.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 2400
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Mon Oct  2 11:52:26 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.18/0.46  Running first-order model finding
% 0.18/0.46  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.AhSLgKpN5Y/E---3.1_7995.p
% 0.18/0.47  # Version: 3.1pre001
% 0.18/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47  # Starting sh5l with 300s (1) cores
% 0.18/0.47  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8073 completed with status 0
% 0.18/0.47  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47  # No SInE strategy applied
% 0.18/0.47  # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.18/0.47  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47  # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.18/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.47  # Starting new_bool_3 with 136s (1) cores
% 0.18/0.47  # Starting new_bool_1 with 136s (1) cores
% 0.18/0.47  # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.18/0.47  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8079 completed with status 0
% 0.18/0.47  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47  # No SInE strategy applied
% 0.18/0.47  # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.18/0.47  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47  # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.18/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.47  # Preprocessing time       : 0.001 s
% 0.18/0.47  # Presaturation interreduction done
% 0.18/0.47  
% 0.18/0.47  # Proof found!
% 0.18/0.47  # SZS status Unsatisfiable
% 0.18/0.47  # SZS output start CNFRefutation
% See solution above
% 0.18/0.47  # Parsed axioms                        : 9
% 0.18/0.47  # Removed by relevancy pruning/SinE    : 0
% 0.18/0.47  # Initial clauses                      : 9
% 0.18/0.47  # Removed in clause preprocessing      : 0
% 0.18/0.47  # Initial clauses in saturation        : 9
% 0.18/0.47  # Processed clauses                    : 56
% 0.18/0.47  # ...of these trivial                  : 0
% 0.18/0.47  # ...subsumed                          : 9
% 0.18/0.47  # ...remaining for further processing  : 47
% 0.18/0.47  # Other redundant clauses eliminated   : 0
% 0.18/0.47  # Clauses deleted for lack of memory   : 0
% 0.18/0.47  # Backward-subsumed                    : 0
% 0.18/0.47  # Backward-rewritten                   : 1
% 0.18/0.47  # Generated clauses                    : 67
% 0.18/0.47  # ...of the previous two non-redundant : 61
% 0.18/0.47  # ...aggressively subsumed             : 0
% 0.18/0.47  # Contextual simplify-reflections      : 0
% 0.18/0.47  # Paramodulations                      : 67
% 0.18/0.47  # Factorizations                       : 0
% 0.18/0.47  # NegExts                              : 0
% 0.18/0.47  # Equation resolutions                 : 0
% 0.18/0.47  # Total rewrite steps                  : 2
% 0.18/0.47  # Propositional unsat checks           : 0
% 0.18/0.47  #    Propositional check models        : 0
% 0.18/0.47  #    Propositional check unsatisfiable : 0
% 0.18/0.47  #    Propositional clauses             : 0
% 0.18/0.47  #    Propositional clauses after purity: 0
% 0.18/0.47  #    Propositional unsat core size     : 0
% 0.18/0.47  #    Propositional preprocessing time  : 0.000
% 0.18/0.47  #    Propositional encoding time       : 0.000
% 0.18/0.47  #    Propositional solver time         : 0.000
% 0.18/0.47  #    Success case prop preproc time    : 0.000
% 0.18/0.47  #    Success case prop encoding time   : 0.000
% 0.18/0.47  #    Success case prop solver time     : 0.000
% 0.18/0.47  # Current number of processed clauses  : 37
% 0.18/0.47  #    Positive orientable unit clauses  : 8
% 0.18/0.47  #    Positive unorientable unit clauses: 0
% 0.18/0.47  #    Negative unit clauses             : 11
% 0.18/0.47  #    Non-unit-clauses                  : 18
% 0.18/0.47  # Current number of unprocessed clauses: 23
% 0.18/0.47  # ...number of literals in the above   : 45
% 0.18/0.47  # Current number of archived formulas  : 0
% 0.18/0.47  # Current number of archived clauses   : 10
% 0.18/0.47  # Clause-clause subsumption calls (NU) : 105
% 0.18/0.47  # Rec. Clause-clause subsumption calls : 105
% 0.18/0.47  # Non-unit clause-clause subsumptions  : 8
% 0.18/0.47  # Unit Clause-clause subsumption calls : 29
% 0.18/0.47  # Rewrite failures with RHS unbound    : 0
% 0.18/0.47  # BW rewrite match attempts            : 29
% 0.18/0.47  # BW rewrite match successes           : 1
% 0.18/0.47  # Condensation attempts                : 0
% 0.18/0.47  # Condensation successes               : 0
% 0.18/0.47  # Termbank termtop insertions          : 1106
% 0.18/0.47  
% 0.18/0.47  # -------------------------------------------------
% 0.18/0.47  # User time                : 0.003 s
% 0.18/0.47  # System time              : 0.003 s
% 0.18/0.47  # Total time               : 0.005 s
% 0.18/0.47  # Maximum resident set size: 1596 pages
% 0.18/0.47  
% 0.18/0.47  # -------------------------------------------------
% 0.18/0.47  # User time                : 0.010 s
% 0.18/0.47  # System time              : 0.010 s
% 0.18/0.47  # Total time               : 0.020 s
% 0.18/0.47  # Maximum resident set size: 1676 pages
% 0.18/0.47  % E---3.1 exiting
%------------------------------------------------------------------------------