TSTP Solution File: HEN006-6 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n009.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:50:59 EDT 2023

% Result   : Unsatisfiable 0.19s 0.49s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   35 (  29 unt;   0 nHn;  15 RR)
%            Number of literals    :   43 (  19 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   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   :   44 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(quotient_property,axiom,
    less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
    file('/export/starexec/sandbox/tmp/tmp.OPe3igiU6G/E---3.1_29809.p',quotient_property) ).

cnf(zero_divide_anything_is_zero,axiom,
    divide(zero,X1) = zero,
    file('/export/starexec/sandbox/tmp/tmp.OPe3igiU6G/E---3.1_29809.p',zero_divide_anything_is_zero) ).

cnf(x_divide_x_is_zero,axiom,
    divide(X1,X1) = zero,
    file('/export/starexec/sandbox/tmp/tmp.OPe3igiU6G/E---3.1_29809.p',x_divide_x_is_zero) ).

cnf(less_equal_and_equal,axiom,
    ( X1 = X2
    | ~ less_equal(X1,X2)
    | ~ less_equal(X2,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.OPe3igiU6G/E---3.1_29809.p',less_equal_and_equal) ).

cnf(zero_is_smallest,axiom,
    less_equal(zero,X1),
    file('/export/starexec/sandbox/tmp/tmp.OPe3igiU6G/E---3.1_29809.p',zero_is_smallest) ).

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

cnf(quotient_less_equal1,axiom,
    ( divide(X1,X2) = zero
    | ~ less_equal(X1,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.OPe3igiU6G/E---3.1_29809.p',quotient_less_equal1) ).

cnf(a_divide_b_LE_d,hypothesis,
    less_equal(divide(a,b),d),
    file('/export/starexec/sandbox/tmp/tmp.OPe3igiU6G/E---3.1_29809.p',a_divide_b_LE_d) ).

cnf(quotient_smaller_than_numerator,axiom,
    less_equal(divide(X1,X2),X1),
    file('/export/starexec/sandbox/tmp/tmp.OPe3igiU6G/E---3.1_29809.p',quotient_smaller_than_numerator) ).

cnf(prove_a_divide_d_LE_b,negated_conjecture,
    ~ less_equal(divide(a,d),b),
    file('/export/starexec/sandbox/tmp/tmp.OPe3igiU6G/E---3.1_29809.p',prove_a_divide_d_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,axiom,
    divide(zero,X1) = zero,
    zero_divide_anything_is_zero ).

cnf(c_0_12,plain,
    less_equal(divide(divide(X1,X2),zero),divide(divide(X1,zero),X2)),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,axiom,
    divide(X1,X1) = zero,
    x_divide_x_is_zero ).

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

cnf(c_0_15,plain,
    less_equal(divide(divide(X1,divide(X1,zero)),zero),zero),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

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

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

cnf(c_0_18,plain,
    divide(divide(X1,divide(X1,zero)),zero) = zero,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

cnf(c_0_19,plain,
    less_equal(divide(X1,divide(X1,zero)),zero),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_20,plain,
    divide(X1,divide(X1,zero)) = zero,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_19]),c_0_16])]) ).

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

cnf(c_0_22,hypothesis,
    less_equal(divide(a,b),d),
    a_divide_b_LE_d ).

cnf(c_0_23,axiom,
    less_equal(divide(X1,X2),X1),
    quotient_smaller_than_numerator ).

cnf(c_0_24,plain,
    less_equal(X1,divide(X1,zero)),
    inference(spm,[status(thm)],[c_0_17,c_0_20]) ).

cnf(c_0_25,hypothesis,
    divide(divide(a,b),d) = zero,
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,plain,
    divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
    inference(spm,[status(thm)],[c_0_21,c_0_10]) ).

cnf(c_0_27,plain,
    divide(divide(X1,X2),X1) = zero,
    inference(spm,[status(thm)],[c_0_21,c_0_23]) ).

cnf(c_0_28,plain,
    divide(X1,zero) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_24]),c_0_23])]) ).

cnf(c_0_29,hypothesis,
    less_equal(divide(divide(a,d),divide(b,d)),zero),
    inference(spm,[status(thm)],[c_0_10,c_0_25]) ).

cnf(c_0_30,plain,
    divide(divide(X1,X2),divide(divide(X1,divide(X2,X3)),X2)) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).

cnf(c_0_31,hypothesis,
    divide(divide(a,d),divide(b,d)) = zero,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_29]),c_0_16])]) ).

cnf(c_0_32,hypothesis,
    divide(divide(a,d),b) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_11]),c_0_28]) ).

cnf(c_0_33,negated_conjecture,
    ~ less_equal(divide(a,d),b),
    prove_a_divide_d_LE_b ).

cnf(c_0_34,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_32]),c_0_33]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12  % Problem    : HEN006-6 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n009.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 11:14:59 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 0.19/0.46  Running first-order model finding
% 0.19/0.47  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.OPe3igiU6G/E---3.1_29809.p
% 0.19/0.49  # Version: 3.1pre001
% 0.19/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49  # Starting sh5l with 300s (1) cores
% 0.19/0.49  # new_bool_3 with pid 29912 completed with status 0
% 0.19/0.49  # Result found by new_bool_3
% 0.19/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49  # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.19/0.49  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49  # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.19/0.49  # G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with pid 29920 completed with status 0
% 0.19/0.49  # Result found by G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S
% 0.19/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49  # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.19/0.49  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49  # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.19/0.49  # Preprocessing time       : 0.001 s
% 0.19/0.49  # Presaturation interreduction done
% 0.19/0.49  
% 0.19/0.49  # Proof found!
% 0.19/0.49  # SZS status Unsatisfiable
% 0.19/0.49  # SZS output start CNFRefutation
% See solution above
% 0.19/0.49  # Parsed axioms                        : 12
% 0.19/0.49  # Removed by relevancy pruning/SinE    : 2
% 0.19/0.49  # Initial clauses                      : 10
% 0.19/0.49  # Removed in clause preprocessing      : 0
% 0.19/0.49  # Initial clauses in saturation        : 10
% 0.19/0.49  # Processed clauses                    : 79
% 0.19/0.49  # ...of these trivial                  : 2
% 0.19/0.49  # ...subsumed                          : 8
% 0.19/0.49  # ...remaining for further processing  : 69
% 0.19/0.49  # Other redundant clauses eliminated   : 0
% 0.19/0.49  # Clauses deleted for lack of memory   : 0
% 0.19/0.49  # Backward-subsumed                    : 0
% 0.19/0.49  # Backward-rewritten                   : 12
% 0.19/0.49  # Generated clauses                    : 1231
% 0.19/0.49  # ...of the previous two non-redundant : 295
% 0.19/0.49  # ...aggressively subsumed             : 0
% 0.19/0.49  # Contextual simplify-reflections      : 0
% 0.19/0.49  # Paramodulations                      : 1230
% 0.19/0.49  # Factorizations                       : 0
% 0.19/0.49  # NegExts                              : 0
% 0.19/0.49  # Equation resolutions                 : 1
% 0.19/0.49  # Total rewrite steps                  : 2078
% 0.19/0.49  # Propositional unsat checks           : 0
% 0.19/0.49  #    Propositional check models        : 0
% 0.19/0.49  #    Propositional check unsatisfiable : 0
% 0.19/0.49  #    Propositional clauses             : 0
% 0.19/0.49  #    Propositional clauses after purity: 0
% 0.19/0.49  #    Propositional unsat core size     : 0
% 0.19/0.49  #    Propositional preprocessing time  : 0.000
% 0.19/0.49  #    Propositional encoding time       : 0.000
% 0.19/0.49  #    Propositional solver time         : 0.000
% 0.19/0.49  #    Success case prop preproc time    : 0.000
% 0.19/0.49  #    Success case prop encoding time   : 0.000
% 0.19/0.49  #    Success case prop solver time     : 0.000
% 0.19/0.49  # Current number of processed clauses  : 47
% 0.19/0.49  #    Positive orientable unit clauses  : 36
% 0.19/0.49  #    Positive unorientable unit clauses: 0
% 0.19/0.49  #    Negative unit clauses             : 1
% 0.19/0.49  #    Non-unit-clauses                  : 10
% 0.19/0.49  # Current number of unprocessed clauses: 215
% 0.19/0.49  # ...number of literals in the above   : 253
% 0.19/0.49  # Current number of archived formulas  : 0
% 0.19/0.49  # Current number of archived clauses   : 22
% 0.19/0.49  # Clause-clause subsumption calls (NU) : 24
% 0.19/0.49  # Rec. Clause-clause subsumption calls : 24
% 0.19/0.49  # Non-unit clause-clause subsumptions  : 8
% 0.19/0.49  # Unit Clause-clause subsumption calls : 2
% 0.19/0.49  # Rewrite failures with RHS unbound    : 0
% 0.19/0.49  # BW rewrite match attempts            : 77
% 0.19/0.49  # BW rewrite match successes           : 9
% 0.19/0.49  # Condensation attempts                : 0
% 0.19/0.49  # Condensation successes               : 0
% 0.19/0.49  # Termbank termtop insertions          : 12394
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.010 s
% 0.19/0.49  # System time              : 0.003 s
% 0.19/0.49  # Total time               : 0.014 s
% 0.19/0.49  # Maximum resident set size: 1652 pages
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.012 s
% 0.19/0.49  # System time              : 0.005 s
% 0.19/0.49  # Total time               : 0.017 s
% 0.19/0.49  # Maximum resident set size: 1672 pages
% 0.19/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------