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

View Problem - Process Solution

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

% Computer : n001.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:29:48 EDT 2023

% Result   : Unsatisfiable 0.19s 0.53s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  12 unt;   0 nHn;  18 RR)
%            Number of literals    :   35 (   0 equ;  18 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   20 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_001,axiom,
    ( k1(X1)
    | ~ n0(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.Q2H6WZgRwe/E---3.1_9306.p',rule_001) ).

cnf(axiom_37,axiom,
    n0(b,a),
    file('/export/starexec/sandbox2/tmp/tmp.Q2H6WZgRwe/E---3.1_9306.p',axiom_37) ).

cnf(rule_034,axiom,
    ( m1(X1,X2,X2)
    | ~ k1(a)
    | ~ k1(X2)
    | ~ q0(X1,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.Q2H6WZgRwe/E---3.1_9306.p',rule_034) ).

cnf(axiom_17,axiom,
    q0(X1,d),
    file('/export/starexec/sandbox2/tmp/tmp.Q2H6WZgRwe/E---3.1_9306.p',axiom_17) ).

cnf(rule_113,axiom,
    ( q1(X1,X1,X2)
    | ~ r0(X3)
    | ~ m1(X1,X2,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.Q2H6WZgRwe/E---3.1_9306.p',rule_113) ).

cnf(prove_this,negated_conjecture,
    ~ q1(d,d,a),
    file('/export/starexec/sandbox2/tmp/tmp.Q2H6WZgRwe/E---3.1_9306.p',prove_this) ).

cnf(axiom_13,axiom,
    r0(e),
    file('/export/starexec/sandbox2/tmp/tmp.Q2H6WZgRwe/E---3.1_9306.p',axiom_13) ).

cnf(c_0_7,axiom,
    ( k1(X1)
    | ~ n0(X2,X1) ),
    rule_001 ).

cnf(c_0_8,axiom,
    n0(b,a),
    axiom_37 ).

cnf(c_0_9,axiom,
    ( m1(X1,X2,X2)
    | ~ k1(a)
    | ~ k1(X2)
    | ~ q0(X1,X1) ),
    rule_034 ).

cnf(c_0_10,plain,
    k1(a),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    ( m1(X1,X2,X2)
    | ~ k1(X2)
    | ~ q0(X1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).

cnf(c_0_12,axiom,
    q0(X1,d),
    axiom_17 ).

cnf(c_0_13,plain,
    ( m1(d,X1,X1)
    | ~ k1(X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_14,axiom,
    ( q1(X1,X1,X2)
    | ~ r0(X3)
    | ~ m1(X1,X2,X2) ),
    rule_113 ).

cnf(c_0_15,plain,
    m1(d,a,a),
    inference(spm,[status(thm)],[c_0_13,c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    ~ q1(d,d,a),
    prove_this ).

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

cnf(c_0_18,plain,
    ~ r0(X1),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).

cnf(c_0_19,plain,
    $false,
    inference(sr,[status(thm)],[c_0_17,c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SYN293-1 : TPTP v8.1.2. Released v1.1.0.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n001.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 19:03:22 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.Q2H6WZgRwe/E---3.1_9306.p
% 0.19/0.53  # Version: 3.1pre001
% 0.19/0.53  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.53  # Starting sh5l with 300s (1) cores
% 0.19/0.53  # new_bool_3 with pid 9391 completed with status 0
% 0.19/0.53  # Result found by new_bool_3
% 0.19/0.53  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.53  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.19/0.53  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.53  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.53  # SAT001_MinMin_p005000_rr_RG with pid 9394 completed with status 0
% 0.19/0.53  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.53  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.53  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.19/0.53  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.53  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.53  # Preprocessing time       : 0.003 s
% 0.19/0.53  # Presaturation interreduction done
% 0.19/0.53  
% 0.19/0.53  # Proof found!
% 0.19/0.53  # SZS status Unsatisfiable
% 0.19/0.53  # SZS output start CNFRefutation
% See solution above
% 0.19/0.53  # Parsed axioms                        : 369
% 0.19/0.53  # Removed by relevancy pruning/SinE    : 160
% 0.19/0.53  # Initial clauses                      : 209
% 0.19/0.53  # Removed in clause preprocessing      : 5
% 0.19/0.53  # Initial clauses in saturation        : 204
% 0.19/0.53  # Processed clauses                    : 459
% 0.19/0.53  # ...of these trivial                  : 29
% 0.19/0.53  # ...subsumed                          : 15
% 0.19/0.53  # ...remaining for further processing  : 415
% 0.19/0.53  # Other redundant clauses eliminated   : 0
% 0.19/0.53  # Clauses deleted for lack of memory   : 0
% 0.19/0.53  # Backward-subsumed                    : 18
% 0.19/0.53  # Backward-rewritten                   : 41
% 0.19/0.53  # Generated clauses                    : 414
% 0.19/0.53  # ...of the previous two non-redundant : 275
% 0.19/0.53  # ...aggressively subsumed             : 0
% 0.19/0.54  # Contextual simplify-reflections      : 1
% 0.19/0.54  # Paramodulations                      : 412
% 0.19/0.54  # Factorizations                       : 0
% 0.19/0.54  # NegExts                              : 0
% 0.19/0.54  # Equation resolutions                 : 0
% 0.19/0.54  # Total rewrite steps                  : 329
% 0.19/0.54  # Propositional unsat checks           : 0
% 0.19/0.54  #    Propositional check models        : 0
% 0.19/0.54  #    Propositional check unsatisfiable : 0
% 0.19/0.54  #    Propositional clauses             : 0
% 0.19/0.54  #    Propositional clauses after purity: 0
% 0.19/0.54  #    Propositional unsat core size     : 0
% 0.19/0.54  #    Propositional preprocessing time  : 0.000
% 0.19/0.54  #    Propositional encoding time       : 0.000
% 0.19/0.54  #    Propositional solver time         : 0.000
% 0.19/0.54  #    Success case prop preproc time    : 0.000
% 0.19/0.54  #    Success case prop encoding time   : 0.000
% 0.19/0.54  #    Success case prop solver time     : 0.000
% 0.19/0.54  # Current number of processed clauses  : 177
% 0.19/0.54  #    Positive orientable unit clauses  : 83
% 0.19/0.54  #    Positive unorientable unit clauses: 0
% 0.19/0.54  #    Negative unit clauses             : 2
% 0.19/0.54  #    Non-unit-clauses                  : 92
% 0.19/0.54  # Current number of unprocessed clauses: 191
% 0.19/0.54  # ...number of literals in the above   : 405
% 0.19/0.54  # Current number of archived formulas  : 0
% 0.19/0.54  # Current number of archived clauses   : 238
% 0.19/0.54  # Clause-clause subsumption calls (NU) : 10229
% 0.19/0.54  # Rec. Clause-clause subsumption calls : 7679
% 0.19/0.54  # Non-unit clause-clause subsumptions  : 21
% 0.19/0.54  # Unit Clause-clause subsumption calls : 150
% 0.19/0.54  # Rewrite failures with RHS unbound    : 0
% 0.19/0.54  # BW rewrite match attempts            : 112
% 0.19/0.54  # BW rewrite match successes           : 28
% 0.19/0.54  # Condensation attempts                : 0
% 0.19/0.54  # Condensation successes               : 0
% 0.19/0.54  # Termbank termtop insertions          : 10815
% 0.19/0.54  
% 0.19/0.54  # -------------------------------------------------
% 0.19/0.54  # User time                : 0.027 s
% 0.19/0.54  # System time              : 0.004 s
% 0.19/0.54  # Total time               : 0.031 s
% 0.19/0.54  # Maximum resident set size: 2296 pages
% 0.19/0.54  
% 0.19/0.54  # -------------------------------------------------
% 0.19/0.54  # User time                : 0.034 s
% 0.19/0.54  # System time              : 0.005 s
% 0.19/0.54  # Total time               : 0.039 s
% 0.19/0.54  # Maximum resident set size: 1996 pages
% 0.19/0.54  % E---3.1 exiting
%------------------------------------------------------------------------------