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

View Problem - Process Solution

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

% Computer : n010.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:21 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_021,axiom,
    ( m1(X1,X2,X1)
    | ~ l0(X1)
    | ~ k0(X2) ),
    file('/export/starexec/sandbox/tmp/tmp.Rom7f1MXCS/E---3.1_2941.p',rule_021) ).

cnf(axiom_28,axiom,
    k0(e),
    file('/export/starexec/sandbox/tmp/tmp.Rom7f1MXCS/E---3.1_2941.p',axiom_28) ).

cnf(axiom_24,axiom,
    l0(c),
    file('/export/starexec/sandbox/tmp/tmp.Rom7f1MXCS/E---3.1_2941.p',axiom_24) ).

cnf(rule_176,axiom,
    ( p2(X1,X2,X1)
    | ~ m1(X2,X1,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.Rom7f1MXCS/E---3.1_2941.p',rule_176) ).

cnf(rule_215,axiom,
    ( l3(X1,X2)
    | ~ r0(X1)
    | ~ p2(X1,X2,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.Rom7f1MXCS/E---3.1_2941.p',rule_215) ).

cnf(axiom_13,axiom,
    r0(e),
    file('/export/starexec/sandbox/tmp/tmp.Rom7f1MXCS/E---3.1_2941.p',axiom_13) ).

cnf(prove_this,negated_conjecture,
    ~ l3(e,c),
    file('/export/starexec/sandbox/tmp/tmp.Rom7f1MXCS/E---3.1_2941.p',prove_this) ).

cnf(c_0_7,axiom,
    ( m1(X1,X2,X1)
    | ~ l0(X1)
    | ~ k0(X2) ),
    rule_021 ).

cnf(c_0_8,axiom,
    k0(e),
    axiom_28 ).

cnf(c_0_9,plain,
    ( m1(X1,e,X1)
    | ~ l0(X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,axiom,
    l0(c),
    axiom_24 ).

cnf(c_0_11,axiom,
    ( p2(X1,X2,X1)
    | ~ m1(X2,X1,X2) ),
    rule_176 ).

cnf(c_0_12,plain,
    m1(c,e,c),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,axiom,
    ( l3(X1,X2)
    | ~ r0(X1)
    | ~ p2(X1,X2,X1) ),
    rule_215 ).

cnf(c_0_14,plain,
    p2(e,c,e),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

cnf(c_0_16,negated_conjecture,
    ~ l3(e,c),
    prove_this ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN125-1 : TPTP v8.1.2. Released v1.1.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n010.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 2400
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon Oct  2 18:25:05 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 0.19/0.48  Running first-order model finding
% 0.19/0.48  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.Rom7f1MXCS/E---3.1_2941.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  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3018 completed with status 0
% 0.19/0.53  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 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  # No SInE strategy applied
% 0.19/0.53  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.19/0.53  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.53  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.53  # Starting new_bool_3 with 136s (1) cores
% 0.19/0.53  # Starting new_bool_1 with 136s (1) cores
% 0.19/0.53  # Starting sh5l with 136s (1) cores
% 0.19/0.53  # SAT001_MinMin_p005000_rr_RG with pid 3022 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  # No SInE strategy applied
% 0.19/0.53  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.19/0.53  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.53  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.53  # Preprocessing time       : 0.004 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    : 0
% 0.19/0.53  # Initial clauses                      : 369
% 0.19/0.53  # Removed in clause preprocessing      : 7
% 0.19/0.53  # Initial clauses in saturation        : 362
% 0.19/0.53  # Processed clauses                    : 750
% 0.19/0.53  # ...of these trivial                  : 19
% 0.19/0.53  # ...subsumed                          : 26
% 0.19/0.53  # ...remaining for further processing  : 705
% 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                    : 13
% 0.19/0.53  # Backward-rewritten                   : 36
% 0.19/0.53  # Generated clauses                    : 484
% 0.19/0.53  # ...of the previous two non-redundant : 346
% 0.19/0.53  # ...aggressively subsumed             : 0
% 0.19/0.53  # Contextual simplify-reflections      : 2
% 0.19/0.53  # Paramodulations                      : 484
% 0.19/0.53  # Factorizations                       : 0
% 0.19/0.53  # NegExts                              : 0
% 0.19/0.53  # Equation resolutions                 : 0
% 0.19/0.53  # Total rewrite steps                  : 313
% 0.19/0.53  # Propositional unsat checks           : 0
% 0.19/0.53  #    Propositional check models        : 0
% 0.19/0.53  #    Propositional check unsatisfiable : 0
% 0.19/0.53  #    Propositional clauses             : 0
% 0.19/0.53  #    Propositional clauses after purity: 0
% 0.19/0.53  #    Propositional unsat core size     : 0
% 0.19/0.53  #    Propositional preprocessing time  : 0.000
% 0.19/0.53  #    Propositional encoding time       : 0.000
% 0.19/0.53  #    Propositional solver time         : 0.000
% 0.19/0.53  #    Success case prop preproc time    : 0.000
% 0.19/0.53  #    Success case prop encoding time   : 0.000
% 0.19/0.53  #    Success case prop solver time     : 0.000
% 0.19/0.53  # Current number of processed clauses  : 328
% 0.19/0.53  #    Positive orientable unit clauses  : 123
% 0.19/0.53  #    Positive unorientable unit clauses: 0
% 0.19/0.53  #    Negative unit clauses             : 1
% 0.19/0.53  #    Non-unit-clauses                  : 204
% 0.19/0.53  # Current number of unprocessed clauses: 272
% 0.19/0.53  # ...number of literals in the above   : 675
% 0.19/0.53  # Current number of archived formulas  : 0
% 0.19/0.53  # Current number of archived clauses   : 377
% 0.19/0.53  # Clause-clause subsumption calls (NU) : 33821
% 0.19/0.53  # Rec. Clause-clause subsumption calls : 24410
% 0.19/0.53  # Non-unit clause-clause subsumptions  : 34
% 0.19/0.53  # Unit Clause-clause subsumption calls : 344
% 0.19/0.53  # Rewrite failures with RHS unbound    : 0
% 0.19/0.53  # BW rewrite match attempts            : 52
% 0.19/0.53  # BW rewrite match successes           : 33
% 0.19/0.53  # Condensation attempts                : 0
% 0.19/0.53  # Condensation successes               : 0
% 0.19/0.53  # Termbank termtop insertions          : 14447
% 0.19/0.53  
% 0.19/0.53  # -------------------------------------------------
% 0.19/0.53  # User time                : 0.032 s
% 0.19/0.53  # System time              : 0.005 s
% 0.19/0.53  # Total time               : 0.037 s
% 0.19/0.53  # Maximum resident set size: 2488 pages
% 0.19/0.53  
% 0.19/0.53  # -------------------------------------------------
% 0.19/0.53  # User time                : 0.161 s
% 0.19/0.53  # System time              : 0.011 s
% 0.19/0.53  # Total time               : 0.172 s
% 0.19/0.53  # Maximum resident set size: 2000 pages
% 0.19/0.53  % E---3.1 exiting
%------------------------------------------------------------------------------