TSTP Solution File: HEN007-5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : HEN007-5 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : Mon May 20 21:33:44 EDT 2024
% Result : Unsatisfiable 0.40s 0.57s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 17 unt; 0 nHn; 14 RR)
% Number of literals : 39 ( 38 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_divide_to_zero,axiom,
( divide(X1,X3) = zero
| divide(X1,X2) != zero
| divide(X2,X3) != zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_divide_to_zero) ).
cnf(quotient_smaller_than_numerator,axiom,
divide(divide(X1,X2),X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',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/benchmark/Axioms/HEN003-0.ax',quotient_property) ).
cnf(a_divide_b_is_zero,hypothesis,
divide(a,b) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_divide_b_is_zero) ).
cnf(divide_and_equal,axiom,
( X1 = X2
| divide(X1,X2) != zero
| divide(X2,X1) != zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',divide_and_equal) ).
cnf(zero_is_smallest,axiom,
divide(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',zero_is_smallest) ).
cnf(prove_property_of_divide2,negated_conjecture,
divide(divide(c,b),divide(c,a)) != zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_of_divide2) ).
cnf(c_0_7,plain,
( divide(X1,X3) = zero
| divide(X1,X2) != zero
| divide(X2,X3) != zero ),
inference(fof_simplification,[status(thm)],[transitivity_of_divide_to_zero]) ).
cnf(c_0_8,plain,
( divide(X1,X3) = zero
| divide(X1,X2) != zero
| divide(X2,X3) != zero ),
c_0_7 ).
cnf(c_0_9,axiom,
divide(divide(X1,X2),X1) = zero,
quotient_smaller_than_numerator ).
cnf(c_0_10,axiom,
divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
quotient_property ).
cnf(c_0_11,hypothesis,
divide(a,b) = zero,
a_divide_b_is_zero ).
cnf(c_0_12,plain,
( X1 = X2
| divide(X1,X2) != zero
| divide(X2,X1) != zero ),
inference(fof_simplification,[status(thm)],[divide_and_equal]) ).
cnf(c_0_13,plain,
( divide(X1,X2) = zero
| divide(X1,divide(X2,X3)) != zero ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,hypothesis,
divide(divide(divide(X1,b),zero),divide(divide(X1,a),b)) = zero,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( X1 = X2
| divide(X1,X2) != zero
| divide(X2,X1) != zero ),
c_0_12 ).
cnf(c_0_16,hypothesis,
divide(divide(divide(X1,b),zero),divide(X1,a)) = zero,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
divide(zero,X1) = zero,
zero_is_smallest ).
cnf(c_0_18,plain,
( divide(X1,X2) = X1
| divide(X1,divide(X1,X2)) != zero ),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_19,hypothesis,
divide(divide(divide(divide(X1,b),divide(X1,a)),zero),zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
divide(divide(c,b),divide(c,a)) != zero,
inference(fof_simplification,[status(thm)],[prove_property_of_divide2]) ).
cnf(c_0_21,hypothesis,
divide(divide(divide(X1,b),divide(X1,a)),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
divide(divide(c,b),divide(c,a)) != zero,
c_0_20 ).
cnf(c_0_23,hypothesis,
divide(divide(X1,b),divide(X1,a)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_21]),c_0_21])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.15 % Problem : HEN007-5 : TPTP v8.2.0. Released v1.0.0.
% 0.16/0.16 % Command : run_E %s %d THM
% 0.17/0.38 % Computer : n016.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 300
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Sun May 19 22:54:38 EDT 2024
% 0.17/0.38 % CPUTime :
% 0.38/0.55 Running first-order theorem proving
% 0.38/0.55 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/benchmark/theBenchmark.p
% 0.40/0.57 # Version: 3.1.0
% 0.40/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.40/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.40/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.40/0.57 # Starting sh5l with 300s (1) cores
% 0.40/0.57 # new_bool_3 with pid 16326 completed with status 0
% 0.40/0.57 # Result found by new_bool_3
% 0.40/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.40/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.40/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.57 # Search class: FHUPS-FFSF22-MFFFFFNN
% 0.40/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.57 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 178s (1) cores
% 0.40/0.57 # H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with pid 16330 completed with status 0
% 0.40/0.57 # Result found by H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S
% 0.40/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.40/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.40/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.57 # Search class: FHUPS-FFSF22-MFFFFFNN
% 0.40/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.57 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 178s (1) cores
% 0.40/0.57 # Preprocessing time : 0.001 s
% 0.40/0.57 # Presaturation interreduction done
% 0.40/0.57
% 0.40/0.57 # Proof found!
% 0.40/0.57 # SZS status Unsatisfiable
% 0.40/0.57 # SZS output start CNFRefutation
% See solution above
% 0.40/0.57 # Parsed axioms : 8
% 0.40/0.57 # Removed by relevancy pruning/SinE : 1
% 0.40/0.57 # Initial clauses : 7
% 0.40/0.57 # Removed in clause preprocessing : 0
% 0.40/0.57 # Initial clauses in saturation : 7
% 0.40/0.57 # Processed clauses : 60
% 0.40/0.57 # ...of these trivial : 8
% 0.40/0.57 # ...subsumed : 12
% 0.40/0.57 # ...remaining for further processing : 40
% 0.40/0.57 # Other redundant clauses eliminated : 0
% 0.40/0.57 # Clauses deleted for lack of memory : 0
% 0.40/0.57 # Backward-subsumed : 0
% 0.40/0.57 # Backward-rewritten : 9
% 0.40/0.57 # Generated clauses : 469
% 0.40/0.57 # ...of the previous two non-redundant : 180
% 0.40/0.57 # ...aggressively subsumed : 0
% 0.40/0.57 # Contextual simplify-reflections : 0
% 0.40/0.57 # Paramodulations : 469
% 0.40/0.57 # Factorizations : 0
% 0.40/0.57 # NegExts : 0
% 0.40/0.57 # Equation resolutions : 0
% 0.40/0.57 # Disequality decompositions : 0
% 0.40/0.57 # Total rewrite steps : 653
% 0.40/0.57 # ...of those cached : 544
% 0.40/0.57 # Propositional unsat checks : 0
% 0.40/0.57 # Propositional check models : 0
% 0.40/0.57 # Propositional check unsatisfiable : 0
% 0.40/0.57 # Propositional clauses : 0
% 0.40/0.57 # Propositional clauses after purity: 0
% 0.40/0.57 # Propositional unsat core size : 0
% 0.40/0.57 # Propositional preprocessing time : 0.000
% 0.40/0.57 # Propositional encoding time : 0.000
% 0.40/0.57 # Propositional solver time : 0.000
% 0.40/0.57 # Success case prop preproc time : 0.000
% 0.40/0.57 # Success case prop encoding time : 0.000
% 0.40/0.57 # Success case prop solver time : 0.000
% 0.40/0.57 # Current number of processed clauses : 24
% 0.40/0.57 # Positive orientable unit clauses : 15
% 0.40/0.57 # Positive unorientable unit clauses: 0
% 0.40/0.57 # Negative unit clauses : 0
% 0.40/0.57 # Non-unit-clauses : 9
% 0.40/0.57 # Current number of unprocessed clauses: 109
% 0.40/0.57 # ...number of literals in the above : 152
% 0.40/0.57 # Current number of archived formulas : 0
% 0.40/0.57 # Current number of archived clauses : 16
% 0.40/0.57 # Clause-clause subsumption calls (NU) : 34
% 0.40/0.57 # Rec. Clause-clause subsumption calls : 34
% 0.40/0.57 # Non-unit clause-clause subsumptions : 12
% 0.40/0.57 # Unit Clause-clause subsumption calls : 4
% 0.40/0.57 # Rewrite failures with RHS unbound : 0
% 0.40/0.57 # BW rewrite match attempts : 47
% 0.40/0.57 # BW rewrite match successes : 9
% 0.40/0.57 # Condensation attempts : 0
% 0.40/0.57 # Condensation successes : 0
% 0.40/0.57 # Termbank termtop insertions : 4921
% 0.40/0.57 # Search garbage collected termcells : 15
% 0.40/0.57
% 0.40/0.57 # -------------------------------------------------
% 0.40/0.57 # User time : 0.006 s
% 0.40/0.57 # System time : 0.003 s
% 0.40/0.57 # Total time : 0.009 s
% 0.40/0.57 # Maximum resident set size: 1616 pages
% 0.40/0.57
% 0.40/0.57 # -------------------------------------------------
% 0.40/0.57 # User time : 0.009 s
% 0.40/0.57 # System time : 0.003 s
% 0.40/0.57 # Total time : 0.012 s
% 0.40/0.57 # Maximum resident set size: 1696 pages
% 0.40/0.57 % E---3.1 exiting
% 0.40/0.57 % E exiting
%------------------------------------------------------------------------------