TSTP Solution File: HEN004-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : HEN004-6 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:02:27 EDT 2024
% Result : Unsatisfiable 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of clauses : 34 ( 25 unt; 0 nHn; 13 RR)
% Number of literals : 46 ( 21 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal1,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.BHQ4ud6ICg/E---3.1_9266.p',quotient_less_equal1) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X1,X2),X1),
file('/export/starexec/sandbox/tmp/tmp.BHQ4ud6ICg/E---3.1_9266.p',quotient_smaller_than_numerator) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.BHQ4ud6ICg/E---3.1_9266.p',less_equal_and_equal) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
file('/export/starexec/sandbox/tmp/tmp.BHQ4ud6ICg/E---3.1_9266.p',quotient_property) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox/tmp/tmp.BHQ4ud6ICg/E---3.1_9266.p',zero_is_smallest) ).
cnf(quotient_less_equal2,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox/tmp/tmp.BHQ4ud6ICg/E---3.1_9266.p',quotient_less_equal2) ).
cnf(zero_divide_anything_is_zero,axiom,
divide(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/tmp.BHQ4ud6ICg/E---3.1_9266.p',zero_divide_anything_is_zero) ).
cnf(prove_x_divide_zero_is_x,negated_conjecture,
divide(a,zero) != a,
file('/export/starexec/sandbox/tmp/tmp.BHQ4ud6ICg/E---3.1_9266.p',prove_x_divide_zero_is_x) ).
cnf(c_0_8,plain,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[quotient_less_equal1]) ).
cnf(c_0_9,plain,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
c_0_8 ).
cnf(c_0_10,axiom,
less_equal(divide(X1,X2),X1),
quotient_smaller_than_numerator ).
cnf(c_0_11,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_12,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_13,plain,
divide(divide(X1,X2),X1) = zero,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
c_0_11 ).
cnf(c_0_15,plain,
less_equal(divide(divide(X1,X1),divide(X2,X1)),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,plain,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
inference(fof_simplification,[status(thm)],[quotient_less_equal2]) ).
cnf(c_0_18,plain,
divide(divide(X1,X1),divide(X2,X1)) = 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,axiom,
divide(zero,X1) = zero,
zero_divide_anything_is_zero ).
cnf(c_0_20,plain,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
c_0_17 ).
cnf(c_0_21,plain,
divide(divide(X1,X1),zero) = zero,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
less_equal(divide(X1,X1),zero),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
less_equal(divide(divide(X1,X2),zero),divide(divide(X1,zero),X2)),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_24,plain,
divide(X1,X1) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_22]),c_0_16])]) ).
cnf(c_0_25,plain,
less_equal(divide(divide(X1,divide(X1,zero)),zero),zero),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,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_25]),c_0_16])]) ).
cnf(c_0_27,plain,
less_equal(divide(X1,divide(X1,zero)),zero),
inference(spm,[status(thm)],[c_0_20,c_0_26]) ).
cnf(c_0_28,plain,
divide(X1,divide(X1,zero)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_27]),c_0_16])]) ).
cnf(c_0_29,negated_conjecture,
divide(a,zero) != a,
inference(fof_simplification,[status(thm)],[prove_x_divide_zero_is_x]) ).
cnf(c_0_30,plain,
less_equal(X1,divide(X1,zero)),
inference(spm,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
divide(a,zero) != a,
c_0_29 ).
cnf(c_0_32,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_30]),c_0_10])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : HEN004-6 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 08:37:59 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.BHQ4ud6ICg/E---3.1_9266.p
% 0.22/0.51 # Version: 3.1.0
% 0.22/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # new_bool_1 with pid 9406 completed with status 0
% 0.22/0.51 # Result found by new_bool_1
% 0.22/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.22/0.51 # G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with pid 9415 completed with status 0
% 0.22/0.51 # Result found by G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S
% 0.22/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Unsatisfiable
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 10
% 0.22/0.51 # Removed by relevancy pruning/SinE : 2
% 0.22/0.51 # Initial clauses : 8
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 8
% 0.22/0.51 # Processed clauses : 36
% 0.22/0.51 # ...of these trivial : 1
% 0.22/0.51 # ...subsumed : 2
% 0.22/0.51 # ...remaining for further processing : 33
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 0
% 0.22/0.51 # Backward-rewritten : 11
% 0.22/0.51 # Generated clauses : 189
% 0.22/0.51 # ...of the previous two non-redundant : 77
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 189
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 239
% 0.22/0.51 # ...of those cached : 179
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 14
% 0.22/0.51 # Positive orientable unit clauses : 9
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 0
% 0.22/0.51 # Non-unit-clauses : 5
% 0.22/0.51 # Current number of unprocessed clauses: 45
% 0.22/0.51 # ...number of literals in the above : 50
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 19
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 4
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 4
% 0.22/0.51 # Non-unit clause-clause subsumptions : 2
% 0.22/0.51 # Unit Clause-clause subsumption calls : 3
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 25
% 0.22/0.51 # BW rewrite match successes : 7
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 1883
% 0.22/0.51 # Search garbage collected termcells : 15
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.005 s
% 0.22/0.51 # System time : 0.002 s
% 0.22/0.51 # Total time : 0.007 s
% 0.22/0.51 # Maximum resident set size: 1604 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.005 s
% 0.22/0.51 # System time : 0.005 s
% 0.22/0.51 # Total time : 0.010 s
% 0.22/0.51 # Maximum resident set size: 1692 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.52 % E exiting
%------------------------------------------------------------------------------