TSTP Solution File: HEN008-4 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n008.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 17:51:01 EDT 2023

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   21 (  15 unt;   0 nHn;  12 RR)
%            Number of literals    :   29 (  10 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   25 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(quotient_less_equal1,axiom,
    ( divide(X1,X2) = zero
    | ~ less_equal(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.G9owm9y5B6/E---3.1_25925.p',quotient_less_equal1) ).

cnf(a_LE_b,hypothesis,
    less_equal(a,b),
    file('/export/starexec/sandbox2/tmp/tmp.G9owm9y5B6/E---3.1_25925.p',a_LE_b) ).

cnf(quotient_property,axiom,
    less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
    file('/export/starexec/sandbox2/tmp/tmp.G9owm9y5B6/E---3.1_25925.p',quotient_property) ).

cnf(zero_divide_anything_is_zero,axiom,
    divide(zero,X1) = zero,
    file('/export/starexec/sandbox2/tmp/tmp.G9owm9y5B6/E---3.1_25925.p',zero_divide_anything_is_zero) ).

cnf(less_equal_and_equal,axiom,
    ( X1 = X2
    | ~ less_equal(X1,X2)
    | ~ less_equal(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.G9owm9y5B6/E---3.1_25925.p',less_equal_and_equal) ).

cnf(zero_is_smallest,axiom,
    less_equal(zero,X1),
    file('/export/starexec/sandbox2/tmp/tmp.G9owm9y5B6/E---3.1_25925.p',zero_is_smallest) ).

cnf(quotient_less_equal2,axiom,
    ( less_equal(X1,X2)
    | divide(X1,X2) != zero ),
    file('/export/starexec/sandbox2/tmp/tmp.G9owm9y5B6/E---3.1_25925.p',quotient_less_equal2) ).

cnf(prove_a_divide_c_LE_b_divide_c,negated_conjecture,
    ~ less_equal(divide(a,c),divide(b,c)),
    file('/export/starexec/sandbox2/tmp/tmp.G9owm9y5B6/E---3.1_25925.p',prove_a_divide_c_LE_b_divide_c) ).

cnf(c_0_8,axiom,
    ( divide(X1,X2) = zero
    | ~ less_equal(X1,X2) ),
    quotient_less_equal1 ).

cnf(c_0_9,hypothesis,
    less_equal(a,b),
    a_LE_b ).

cnf(c_0_10,axiom,
    less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
    quotient_property ).

cnf(c_0_11,hypothesis,
    divide(a,b) = zero,
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,axiom,
    divide(zero,X1) = zero,
    zero_divide_anything_is_zero ).

cnf(c_0_13,axiom,
    ( X1 = X2
    | ~ less_equal(X1,X2)
    | ~ less_equal(X2,X1) ),
    less_equal_and_equal ).

cnf(c_0_14,hypothesis,
    less_equal(divide(divide(a,X1),divide(b,X1)),zero),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).

cnf(c_0_15,axiom,
    less_equal(zero,X1),
    zero_is_smallest ).

cnf(c_0_16,axiom,
    ( less_equal(X1,X2)
    | divide(X1,X2) != zero ),
    quotient_less_equal2 ).

cnf(c_0_17,hypothesis,
    divide(divide(a,X1),divide(b,X1)) = zero,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

cnf(c_0_18,negated_conjecture,
    ~ less_equal(divide(a,c),divide(b,c)),
    prove_a_divide_c_LE_b_divide_c ).

cnf(c_0_19,hypothesis,
    less_equal(divide(a,X1),divide(b,X1)),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : HEN008-4 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.14  % Command    : run_E %s %d THM
% 0.15/0.35  % Computer : n008.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 2400
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon Oct  2 11:20:58 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 0.20/0.49  Running first-order model finding
% 0.20/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.G9owm9y5B6/E---3.1_25925.p
% 0.20/0.51  # Version: 3.1pre001
% 0.20/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51  # Starting sh5l with 300s (1) cores
% 0.20/0.51  # new_bool_3 with pid 26060 completed with status 0
% 0.20/0.51  # Result found by new_bool_3
% 0.20/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51  # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.20/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51  # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.20/0.51  # G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with pid 26065 completed with status 0
% 0.20/0.51  # Result found by G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S
% 0.20/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51  # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.20/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51  # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.20/0.51  # Preprocessing time       : 0.002 s
% 0.20/0.51  # Presaturation interreduction done
% 0.20/0.51  
% 0.20/0.51  # Proof found!
% 0.20/0.51  # SZS status Unsatisfiable
% 0.20/0.51  # SZS output start CNFRefutation
% See solution above
% 0.20/0.51  # Parsed axioms                        : 16
% 0.20/0.51  # Removed by relevancy pruning/SinE    : 2
% 0.20/0.51  # Initial clauses                      : 14
% 0.20/0.51  # Removed in clause preprocessing      : 0
% 0.20/0.51  # Initial clauses in saturation        : 14
% 0.20/0.51  # Processed clauses                    : 45
% 0.20/0.51  # ...of these trivial                  : 0
% 0.20/0.51  # ...subsumed                          : 0
% 0.20/0.51  # ...remaining for further processing  : 45
% 0.20/0.51  # Other redundant clauses eliminated   : 0
% 0.20/0.51  # Clauses deleted for lack of memory   : 0
% 0.20/0.51  # Backward-subsumed                    : 0
% 0.20/0.51  # Backward-rewritten                   : 7
% 0.20/0.51  # Generated clauses                    : 114
% 0.20/0.51  # ...of the previous two non-redundant : 49
% 0.20/0.51  # ...aggressively subsumed             : 0
% 0.20/0.51  # Contextual simplify-reflections      : 0
% 0.20/0.51  # Paramodulations                      : 114
% 0.20/0.51  # Factorizations                       : 0
% 0.20/0.51  # NegExts                              : 0
% 0.20/0.51  # Equation resolutions                 : 0
% 0.20/0.51  # Total rewrite steps                  : 119
% 0.20/0.51  # Propositional unsat checks           : 0
% 0.20/0.51  #    Propositional check models        : 0
% 0.20/0.51  #    Propositional check unsatisfiable : 0
% 0.20/0.51  #    Propositional clauses             : 0
% 0.20/0.51  #    Propositional clauses after purity: 0
% 0.20/0.51  #    Propositional unsat core size     : 0
% 0.20/0.51  #    Propositional preprocessing time  : 0.000
% 0.20/0.51  #    Propositional encoding time       : 0.000
% 0.20/0.51  #    Propositional solver time         : 0.000
% 0.20/0.51  #    Success case prop preproc time    : 0.000
% 0.20/0.51  #    Success case prop encoding time   : 0.000
% 0.20/0.51  #    Success case prop solver time     : 0.000
% 0.20/0.51  # Current number of processed clauses  : 24
% 0.20/0.51  #    Positive orientable unit clauses  : 17
% 0.20/0.51  #    Positive unorientable unit clauses: 0
% 0.20/0.51  #    Negative unit clauses             : 0
% 0.20/0.51  #    Non-unit-clauses                  : 7
% 0.20/0.51  # Current number of unprocessed clauses: 31
% 0.20/0.51  # ...number of literals in the above   : 38
% 0.20/0.51  # Current number of archived formulas  : 0
% 0.20/0.51  # Current number of archived clauses   : 21
% 0.20/0.51  # Clause-clause subsumption calls (NU) : 4
% 0.20/0.51  # Rec. Clause-clause subsumption calls : 4
% 0.20/0.51  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.51  # Unit Clause-clause subsumption calls : 1
% 0.20/0.51  # Rewrite failures with RHS unbound    : 0
% 0.20/0.51  # BW rewrite match attempts            : 22
% 0.20/0.51  # BW rewrite match successes           : 5
% 0.20/0.51  # Condensation attempts                : 0
% 0.20/0.51  # Condensation successes               : 0
% 0.20/0.51  # Termbank termtop insertions          : 1422
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.007 s
% 0.20/0.51  # System time              : 0.002 s
% 0.20/0.51  # Total time               : 0.009 s
% 0.20/0.51  # Maximum resident set size: 1640 pages
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.009 s
% 0.20/0.51  # System time              : 0.004 s
% 0.20/0.51  # Total time               : 0.014 s
% 0.20/0.51  # Maximum resident set size: 1680 pages
% 0.20/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------