TSTP Solution File: SYN003-1.006 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SYN003-1.006 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n013.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:12:07 EDT 2023

% Result   : Unsatisfiable 0.22s 0.52s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   36 (  16 unt;   0 nHn;  36 RR)
%            Number of literals    :   66 (   0 equ;  32 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :   13 (  12 usr;  13 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(qq_1,negated_conjecture,
    ( q_1
    | ~ q ),
    file('/export/starexec/sandbox/tmp/tmp.VilqKGF3rC/E---3.1_16027.p',qq_1) ).

cnf(base_3,negated_conjecture,
    q,
    file('/export/starexec/sandbox/tmp/tmp.VilqKGF3rC/E---3.1_16027.p',base_3) ).

cnf(pqp_1,negated_conjecture,
    ( p_2
    | ~ p_1
    | ~ q_1 ),
    file('/export/starexec/sandbox/tmp/tmp.VilqKGF3rC/E---3.1_16027.p',pqp_1) ).

cnf(base_1,negated_conjecture,
    p_1,
    file('/export/starexec/sandbox/tmp/tmp.VilqKGF3rC/E---3.1_16027.p',base_1) ).

cnf(qq_2,negated_conjecture,
    ( q_2
    | ~ q ),
    file('/export/starexec/sandbox/tmp/tmp.VilqKGF3rC/E---3.1_16027.p',qq_2) ).

cnf(pqp_2,negated_conjecture,
    ( p_3
    | ~ p_2
    | ~ q_2 ),
    file('/export/starexec/sandbox/tmp/tmp.VilqKGF3rC/E---3.1_16027.p',pqp_2) ).

cnf(qq_3,negated_conjecture,
    ( q_3
    | ~ q ),
    file('/export/starexec/sandbox/tmp/tmp.VilqKGF3rC/E---3.1_16027.p',qq_3) ).

cnf(pqp_3,negated_conjecture,
    ( p_4
    | ~ p_3
    | ~ q_3 ),
    file('/export/starexec/sandbox/tmp/tmp.VilqKGF3rC/E---3.1_16027.p',pqp_3) ).

cnf(qq_4,negated_conjecture,
    ( q_4
    | ~ q ),
    file('/export/starexec/sandbox/tmp/tmp.VilqKGF3rC/E---3.1_16027.p',qq_4) ).

cnf(pqp_4,negated_conjecture,
    ( p_5
    | ~ p_4
    | ~ q_4 ),
    file('/export/starexec/sandbox/tmp/tmp.VilqKGF3rC/E---3.1_16027.p',pqp_4) ).

cnf(qq_5,negated_conjecture,
    ( q_5
    | ~ q ),
    file('/export/starexec/sandbox/tmp/tmp.VilqKGF3rC/E---3.1_16027.p',qq_5) ).

cnf(pqp_5,negated_conjecture,
    ( p_6
    | ~ p_5
    | ~ q_5 ),
    file('/export/starexec/sandbox/tmp/tmp.VilqKGF3rC/E---3.1_16027.p',pqp_5) ).

cnf(base_2,negated_conjecture,
    ~ p_6,
    file('/export/starexec/sandbox/tmp/tmp.VilqKGF3rC/E---3.1_16027.p',base_2) ).

cnf(c_0_13,negated_conjecture,
    ( q_1
    | ~ q ),
    qq_1 ).

cnf(c_0_14,negated_conjecture,
    q,
    base_3 ).

cnf(c_0_15,negated_conjecture,
    ( p_2
    | ~ p_1
    | ~ q_1 ),
    pqp_1 ).

cnf(c_0_16,negated_conjecture,
    p_1,
    base_1 ).

cnf(c_0_17,negated_conjecture,
    q_1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).

cnf(c_0_18,negated_conjecture,
    ( q_2
    | ~ q ),
    qq_2 ).

cnf(c_0_19,negated_conjecture,
    ( p_3
    | ~ p_2
    | ~ q_2 ),
    pqp_2 ).

cnf(c_0_20,negated_conjecture,
    p_2,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).

cnf(c_0_21,negated_conjecture,
    q_2,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_14])]) ).

cnf(c_0_22,negated_conjecture,
    ( q_3
    | ~ q ),
    qq_3 ).

cnf(c_0_23,negated_conjecture,
    ( p_4
    | ~ p_3
    | ~ q_3 ),
    pqp_3 ).

cnf(c_0_24,negated_conjecture,
    p_3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

cnf(c_0_25,negated_conjecture,
    q_3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_14])]) ).

cnf(c_0_26,negated_conjecture,
    ( q_4
    | ~ q ),
    qq_4 ).

cnf(c_0_27,negated_conjecture,
    ( p_5
    | ~ p_4
    | ~ q_4 ),
    pqp_4 ).

cnf(c_0_28,negated_conjecture,
    p_4,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).

cnf(c_0_29,negated_conjecture,
    q_4,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_14])]) ).

cnf(c_0_30,negated_conjecture,
    ( q_5
    | ~ q ),
    qq_5 ).

cnf(c_0_31,negated_conjecture,
    ( p_6
    | ~ p_5
    | ~ q_5 ),
    pqp_5 ).

cnf(c_0_32,negated_conjecture,
    p_5,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).

cnf(c_0_33,negated_conjecture,
    q_5,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_14])]) ).

cnf(c_0_34,negated_conjecture,
    ~ p_6,
    base_2 ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYN003-1.006 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.15  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n013.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 2400
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon Oct  2 17:57:59 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.22/0.51  Running first-order theorem proving
% 0.22/0.51  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.VilqKGF3rC/E---3.1_16027.p
% 0.22/0.52  # Version: 3.1pre001
% 0.22/0.52  # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.22/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.22/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52  # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52  # Starting sh5l with 300s (1) cores
% 0.22/0.52  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 16105 completed with status 0
% 0.22/0.52  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.22/0.52  # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.22/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.22/0.52  # No SInE strategy applied
% 0.22/0.52  # Search class: FHUNF-FFSS00-SFFFFFNN
% 0.22/0.52  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 151s (1) cores
% 0.22/0.52  # Starting new_bool_3 with 136s (1) cores
% 0.22/0.52  # Starting new_bool_1 with 136s (1) cores
% 0.22/0.52  # Starting sh5l with 136s (1) cores
% 0.22/0.52  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 16111 completed with status 0
% 0.22/0.52  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.22/0.52  # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.22/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.22/0.52  # No SInE strategy applied
% 0.22/0.52  # Search class: FHUNF-FFSS00-SFFFFFNN
% 0.22/0.52  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 151s (1) cores
% 0.22/0.52  # Preprocessing time       : 0.001 s
% 0.22/0.52  # Presaturation interreduction done
% 0.22/0.52  
% 0.22/0.52  # Proof found!
% 0.22/0.52  # SZS status Unsatisfiable
% 0.22/0.52  # SZS output start CNFRefutation
% See solution above
% 0.22/0.52  # Parsed axioms                        : 24
% 0.22/0.52  # Removed by relevancy pruning/SinE    : 0
% 0.22/0.52  # Initial clauses                      : 24
% 0.22/0.52  # Removed in clause preprocessing      : 0
% 0.22/0.52  # Initial clauses in saturation        : 24
% 0.22/0.52  # Processed clauses                    : 23
% 0.22/0.52  # ...of these trivial                  : 4
% 0.22/0.52  # ...subsumed                          : 0
% 0.22/0.52  # ...remaining for further processing  : 18
% 0.22/0.52  # Other redundant clauses eliminated   : 0
% 0.22/0.52  # Clauses deleted for lack of memory   : 0
% 0.22/0.52  # Backward-subsumed                    : 0
% 0.22/0.52  # Backward-rewritten                   : 0
% 0.22/0.52  # Generated clauses                    : 0
% 0.22/0.52  # ...of the previous two non-redundant : 0
% 0.22/0.52  # ...aggressively subsumed             : 0
% 0.22/0.52  # Contextual simplify-reflections      : 0
% 0.22/0.52  # Paramodulations                      : 0
% 0.22/0.52  # Factorizations                       : 0
% 0.22/0.52  # NegExts                              : 0
% 0.22/0.52  # Equation resolutions                 : 0
% 0.22/0.52  # Total rewrite steps                  : 32
% 0.22/0.52  # Propositional unsat checks           : 0
% 0.22/0.52  #    Propositional check models        : 0
% 0.22/0.52  #    Propositional check unsatisfiable : 0
% 0.22/0.52  #    Propositional clauses             : 0
% 0.22/0.52  #    Propositional clauses after purity: 0
% 0.22/0.52  #    Propositional unsat core size     : 0
% 0.22/0.52  #    Propositional preprocessing time  : 0.000
% 0.22/0.52  #    Propositional encoding time       : 0.000
% 0.22/0.52  #    Propositional solver time         : 0.000
% 0.22/0.52  #    Success case prop preproc time    : 0.000
% 0.22/0.52  #    Success case prop encoding time   : 0.000
% 0.22/0.52  #    Success case prop solver time     : 0.000
% 0.22/0.52  # Current number of processed clauses  : 18
% 0.22/0.52  #    Positive orientable unit clauses  : 17
% 0.22/0.52  #    Positive unorientable unit clauses: 0
% 0.22/0.52  #    Negative unit clauses             : 1
% 0.22/0.52  #    Non-unit-clauses                  : 0
% 0.22/0.52  # Current number of unprocessed clauses: 1
% 0.22/0.52  # ...number of literals in the above   : 3
% 0.22/0.52  # Current number of archived formulas  : 0
% 0.22/0.52  # Current number of archived clauses   : 0
% 0.22/0.52  # Clause-clause subsumption calls (NU) : 0
% 0.22/0.52  # Rec. Clause-clause subsumption calls : 0
% 0.22/0.52  # Non-unit clause-clause subsumptions  : 0
% 0.22/0.52  # Unit Clause-clause subsumption calls : 0
% 0.22/0.52  # Rewrite failures with RHS unbound    : 0
% 0.22/0.52  # BW rewrite match attempts            : 0
% 0.22/0.52  # BW rewrite match successes           : 0
% 0.22/0.52  # Condensation attempts                : 0
% 0.22/0.52  # Condensation successes               : 0
% 0.22/0.52  # Termbank termtop insertions          : 278
% 0.22/0.52  
% 0.22/0.52  # -------------------------------------------------
% 0.22/0.52  # User time                : 0.000 s
% 0.22/0.52  # System time              : 0.004 s
% 0.22/0.52  # Total time               : 0.004 s
% 0.22/0.52  # Maximum resident set size: 1672 pages
% 0.22/0.52  
% 0.22/0.52  # -------------------------------------------------
% 0.22/0.52  # User time                : 0.004 s
% 0.22/0.52  # System time              : 0.008 s
% 0.22/0.52  # Total time               : 0.012 s
% 0.22/0.52  # Maximum resident set size: 1680 pages
% 0.22/0.52  % E---3.1 exiting
% 0.22/0.52  % E---3.1 exiting
%------------------------------------------------------------------------------