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

View Problem - Process Solution

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

% Computer : n002.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:41 EDT 2023

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

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

cnf(axiom_37,axiom,
    n0(b,a),
    file('/export/starexec/sandbox/tmp/tmp.Z7CYSl6vyV/E---3.1_13120.p',axiom_37) ).

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

cnf(axiom_17,axiom,
    q0(X1,d),
    file('/export/starexec/sandbox/tmp/tmp.Z7CYSl6vyV/E---3.1_13120.p',axiom_17) ).

cnf(axiom_30,axiom,
    n0(e,e),
    file('/export/starexec/sandbox/tmp/tmp.Z7CYSl6vyV/E---3.1_13120.p',axiom_30) ).

cnf(prove_this,negated_conjecture,
    ~ m1(d,e,e),
    file('/export/starexec/sandbox/tmp/tmp.Z7CYSl6vyV/E---3.1_13120.p',prove_this) ).

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

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

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

cnf(c_0_9,plain,
    k1(a),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

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

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

cnf(c_0_12,axiom,
    n0(e,e),
    axiom_30 ).

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

cnf(c_0_14,plain,
    k1(e),
    inference(spm,[status(thm)],[c_0_6,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ~ m1(d,e,e),
    prove_this ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem    : SYN249-1 : TPTP v8.1.2. Released v1.1.0.
% 0.09/0.12  % Command    : run_E %s %d THM
% 0.11/0.31  % Computer : n002.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit   : 2400
% 0.11/0.31  % WCLimit    : 300
% 0.11/0.31  % DateTime   : Mon Oct  2 18:17:59 EDT 2023
% 0.11/0.31  % CPUTime    : 
% 0.15/0.45  Running first-order model finding
% 0.15/0.45  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Z7CYSl6vyV/E---3.1_13120.p
% 0.44/300.17  # Version: 3.1pre001
% 0.44/300.17  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.44/300.17  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/300.17  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.44/300.17  # Starting new_bool_3 with 300s (1) cores
% 0.44/300.17  # Starting new_bool_1 with 300s (1) cores
% 0.44/300.17  # Starting sh5l with 300s (1) cores
% 0.44/300.17  # new_bool_3 with pid 13199 completed with status 0
% 0.44/300.17  # Result found by new_bool_3
% 0.44/300.17  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.44/300.17  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/300.17  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.44/300.17  # Starting new_bool_3 with 300s (1) cores
% 0.44/300.17  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.44/300.17  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.44/300.17  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.44/300.17  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.44/300.17  # SAT001_MinMin_p005000_rr_RG with pid 13206 completed with status 0
% 0.44/300.17  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.44/300.17  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.44/300.17  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/300.17  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.44/300.17  # Starting new_bool_3 with 300s (1) cores
% 0.44/300.17  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.44/300.17  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.44/300.17  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.44/300.17  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.44/300.17  # Preprocessing time       : 0.003 s
% 0.44/300.17  # Presaturation interreduction done
% 0.44/300.17  
% 0.44/300.17  # Proof found!
% 0.44/300.17  # SZS status Unsatisfiable
% 0.44/300.17  # SZS output start CNFRefutation
% See solution above
% 0.44/300.17  # Parsed axioms                        : 369
% 0.44/300.17  # Removed by relevancy pruning/SinE    : 160
% 0.44/300.17  # Initial clauses                      : 209
% 0.44/300.17  # Removed in clause preprocessing      : 5
% 0.44/300.17  # Initial clauses in saturation        : 204
% 0.44/300.17  # Processed clauses                    : 443
% 0.44/300.17  # ...of these trivial                  : 16
% 0.44/300.17  # ...subsumed                          : 19
% 0.44/300.17  # ...remaining for further processing  : 408
% 0.44/300.17  # Other redundant clauses eliminated   : 0
% 0.44/300.17  # Clauses deleted for lack of memory   : 0
% 0.44/300.17  # Backward-subsumed                    : 4
% 0.44/300.17  # Backward-rewritten                   : 26
% 0.44/300.17  # Generated clauses                    : 412
% 0.44/300.17  # ...of the previous two non-redundant : 274
% 0.44/300.17  # ...aggressively subsumed             : 0
% 0.44/300.17  # Contextual simplify-reflections      : 1
% 0.44/300.17  # Paramodulations                      : 412
% 0.44/300.17  # Factorizations                       : 0
% 0.44/300.17  # NegExts                              : 0
% 0.44/300.17  # Equation resolutions                 : 0
% 0.44/300.17  # Total rewrite steps                  : 284
% 0.44/300.17  # Propositional unsat checks           : 0
% 0.44/300.17  #    Propositional check models        : 0
% 0.44/300.17  #    Propositional check unsatisfiable : 0
% 0.44/300.17  #    Propositional clauses             : 0
% 0.44/300.17  #    Propositional clauses after purity: 0
% 0.44/300.17  #    Propositional unsat core size     : 0
% 0.44/300.17  #    Propositional preprocessing time  : 0.000
% 0.44/300.17  #    Propositional encoding time       : 0.000
% 0.44/300.17  #    Propositional solver time         : 0.000
% 0.44/300.17  #    Success case prop preproc time    : 0.000
% 0.44/300.17  #    Success case prop encoding time   : 0.000
% 0.44/300.17  #    Success case prop solver time     : 0.000
% 0.44/300.17  # Current number of processed clauses  : 202
% 0.44/300.17  #    Positive orientable unit clauses  : 95
% 0.44/300.17  #    Positive unorientable unit clauses: 0
% 0.44/300.17  #    Negative unit clauses             : 1
% 0.44/300.17  #    Non-unit-clauses                  : 106
% 0.44/300.17  # Current number of unprocessed clauses: 196
% 0.44/300.17  # ...number of literals in the above   : 413
% 0.44/300.17  # Current number of archived formulas  : 0
% 0.44/300.17  # Current number of archived clauses   : 206
% 0.44/300.17  # Clause-clause subsumption calls (NU) : 9837
% 0.44/300.17  # Rec. Clause-clause subsumption calls : 7467
% 0.44/300.17  # Non-unit clause-clause subsumptions  : 22
% 0.44/300.17  # Unit Clause-clause subsumption calls : 111
% 0.44/300.17  # Rewrite failures with RHS unbound    : 0
% 0.44/300.17  # BW rewrite match attempts            : 77
% 0.44/300.17  # BW rewrite match successes           : 24
% 0.44/300.17  # Condensation attempts                : 0
% 0.44/300.17  # Condensation successes               : 0
% 0.44/300.17  # Termbank termtop insertions          : 10674
% 0.44/300.17  
% 0.44/300.17  # -------------------------------------------------
% 0.44/300.17  # User time                : 0.024 s
% 0.44/300.17  # System time              : 0.003 s
% 0.44/300.17  # Total time               : 0.027 s
% 0.44/300.17  # Maximum resident set size: 2300 pages
% 0.44/300.17  
% 0.44/300.17  # -------------------------------------------------
% 0.44/300.17  # User time                : 0.027 s
% 0.44/300.17  # System time              : 0.005 s
% 0.44/300.17  # Total time               : 0.032 s
% 0.44/300.17  # Maximum resident set size: 2000 pages
% 0.44/300.17  % E---3.1 exiting
%------------------------------------------------------------------------------