TSTP Solution File: HEN003-5 by E---3.1

View Problem - Process Solution

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

% Computer : n012.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:46 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(divide_and_equal,axiom,
    ( X1 = X2
    | divide(X1,X2) != zero
    | divide(X2,X1) != zero ),
    file('/export/starexec/sandbox2/tmp/tmp.oGrVunISgU/E---3.1_19306.p',divide_and_equal) ).

cnf(quotient_smaller_than_numerator,axiom,
    divide(divide(X1,X2),X1) = zero,
    file('/export/starexec/sandbox2/tmp/tmp.oGrVunISgU/E---3.1_19306.p',quotient_smaller_than_numerator) ).

cnf(quotient_property,axiom,
    divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
    file('/export/starexec/sandbox2/tmp/tmp.oGrVunISgU/E---3.1_19306.p',quotient_property) ).

cnf(prove_x_divide_x_is_zero,negated_conjecture,
    divide(a,a) != zero,
    file('/export/starexec/sandbox2/tmp/tmp.oGrVunISgU/E---3.1_19306.p',prove_x_divide_x_is_zero) ).

cnf(c_0_4,axiom,
    ( X1 = X2
    | divide(X1,X2) != zero
    | divide(X2,X1) != zero ),
    divide_and_equal ).

cnf(c_0_5,axiom,
    divide(divide(X1,X2),X1) = zero,
    quotient_smaller_than_numerator ).

cnf(c_0_6,axiom,
    divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
    quotient_property ).

cnf(c_0_7,plain,
    ( divide(X1,X2) = X1
    | divide(X1,divide(X1,X2)) != zero ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_8,plain,
    divide(divide(divide(X1,X1),divide(X2,X1)),zero) = zero,
    inference(spm,[status(thm)],[c_0_6,c_0_5]) ).

cnf(c_0_9,plain,
    divide(divide(X1,X1),divide(X2,X1)) = zero,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_8])]) ).

cnf(c_0_10,negated_conjecture,
    divide(a,a) != zero,
    prove_x_divide_x_is_zero ).

cnf(c_0_11,plain,
    divide(X1,X1) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_9]),c_0_5]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13  % Problem    : HEN003-5 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n012.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Oct  2 11:14:05 EDT 2023
% 0.21/0.36  % CPUTime    : 
% 0.21/0.49  Running first-order theorem proving
% 0.21/0.49  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.oGrVunISgU/E---3.1_19306.p
% 0.37/300.10  # Version: 3.1pre001
% 0.37/300.10  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.37/300.10  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.10  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.37/300.10  # Starting new_bool_3 with 300s (1) cores
% 0.37/300.10  # Starting new_bool_1 with 300s (1) cores
% 0.37/300.10  # Starting sh5l with 300s (1) cores
% 0.37/300.10  # new_bool_3 with pid 19467 completed with status 0
% 0.37/300.10  # Result found by new_bool_3
% 0.37/300.10  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.37/300.10  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.10  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.37/300.10  # Starting new_bool_3 with 300s (1) cores
% 0.37/300.10  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/300.10  # Search class: FHUPS-FFSF22-MFFFFFNN
% 0.37/300.10  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/300.10  # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 178s (1) cores
% 0.37/300.10  # H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with pid 19473 completed with status 0
% 0.37/300.10  # Result found by H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S
% 0.37/300.10  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.37/300.10  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.10  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.37/300.10  # Starting new_bool_3 with 300s (1) cores
% 0.37/300.10  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/300.10  # Search class: FHUPS-FFSF22-MFFFFFNN
% 0.37/300.10  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/300.10  # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 178s (1) cores
% 0.37/300.10  # Preprocessing time       : 0.001 s
% 0.37/300.10  # Presaturation interreduction done
% 0.37/300.10  
% 0.37/300.10  # Proof found!
% 0.37/300.10  # SZS status Unsatisfiable
% 0.37/300.10  # SZS output start CNFRefutation
% See solution above
% 0.37/300.10  # Parsed axioms                        : 6
% 0.37/300.10  # Removed by relevancy pruning/SinE    : 1
% 0.37/300.10  # Initial clauses                      : 5
% 0.37/300.10  # Removed in clause preprocessing      : 0
% 0.37/300.10  # Initial clauses in saturation        : 5
% 0.37/300.10  # Processed clauses                    : 17
% 0.37/300.10  # ...of these trivial                  : 0
% 0.37/300.10  # ...subsumed                          : 2
% 0.37/300.10  # ...remaining for further processing  : 15
% 0.37/300.10  # Other redundant clauses eliminated   : 0
% 0.37/300.10  # Clauses deleted for lack of memory   : 0
% 0.37/300.10  # Backward-subsumed                    : 0
% 0.37/300.10  # Backward-rewritten                   : 3
% 0.37/300.10  # Generated clauses                    : 57
% 0.37/300.10  # ...of the previous two non-redundant : 31
% 0.37/300.10  # ...aggressively subsumed             : 0
% 0.37/300.10  # Contextual simplify-reflections      : 0
% 0.37/300.10  # Paramodulations                      : 57
% 0.37/300.10  # Factorizations                       : 0
% 0.37/300.10  # NegExts                              : 0
% 0.37/300.10  # Equation resolutions                 : 0
% 0.37/300.10  # Total rewrite steps                  : 48
% 0.37/300.10  # Propositional unsat checks           : 0
% 0.37/300.10  #    Propositional check models        : 0
% 0.37/300.10  #    Propositional check unsatisfiable : 0
% 0.37/300.10  #    Propositional clauses             : 0
% 0.37/300.10  #    Propositional clauses after purity: 0
% 0.37/300.10  #    Propositional unsat core size     : 0
% 0.37/300.10  #    Propositional preprocessing time  : 0.000
% 0.37/300.10  #    Propositional encoding time       : 0.000
% 0.37/300.10  #    Propositional solver time         : 0.000
% 0.37/300.10  #    Success case prop preproc time    : 0.000
% 0.37/300.10  #    Success case prop encoding time   : 0.000
% 0.37/300.10  #    Success case prop solver time     : 0.000
% 0.37/300.10  # Current number of processed clauses  : 7
% 0.37/300.10  #    Positive orientable unit clauses  : 4
% 0.37/300.10  #    Positive unorientable unit clauses: 0
% 0.37/300.10  #    Negative unit clauses             : 0
% 0.37/300.10  #    Non-unit-clauses                  : 3
% 0.37/300.10  # Current number of unprocessed clauses: 24
% 0.37/300.10  # ...number of literals in the above   : 27
% 0.37/300.10  # Current number of archived formulas  : 0
% 0.37/300.10  # Current number of archived clauses   : 8
% 0.37/300.10  # Clause-clause subsumption calls (NU) : 4
% 0.37/300.10  # Rec. Clause-clause subsumption calls : 4
% 0.37/300.10  # Non-unit clause-clause subsumptions  : 2
% 0.37/300.10  # Unit Clause-clause subsumption calls : 0
% 0.37/300.10  # Rewrite failures with RHS unbound    : 0
% 0.37/300.10  # BW rewrite match attempts            : 15
% 0.37/300.10  # BW rewrite match successes           : 3
% 0.37/300.10  # Condensation attempts                : 0
% 0.37/300.10  # Condensation successes               : 0
% 0.37/300.10  # Termbank termtop insertions          : 626
% 0.37/300.10  
% 0.37/300.10  # -------------------------------------------------
% 0.37/300.10  # User time                : 0.002 s
% 0.37/300.10  # System time              : 0.002 s
% 0.37/300.10  # Total time               : 0.004 s
% 0.37/300.10  # Maximum resident set size: 1628 pages
% 0.37/300.10  
% 0.37/300.10  # -------------------------------------------------
% 0.37/300.10  # User time                : 0.002 s
% 0.37/300.10  # System time              : 0.005 s
% 0.37/300.10  # Total time               : 0.007 s
% 0.37/300.10  # Maximum resident set size: 1664 pages
% 0.37/300.10  % E---3.1 exiting
% 0.37/300.10  % E---3.1 exiting
%------------------------------------------------------------------------------