TSTP Solution File: HEN011-4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : HEN011-4 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:49 EDT 2024
% Result : Unsatisfiable 2.06s 0.80s
% Output : CNFRefutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 39 ( 21 unt; 0 nHn; 20 RR)
% Number of literals : 63 ( 19 equ; 28 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 87 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_less_equal,axiom,
( less_equal(X1,X3)
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less_equal) ).
cnf(property_of_divide2,axiom,
( less_equal(divide(X3,X2),divide(X3,X1))
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_divide2) ).
cnf(quotient_less_equal2,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_property) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X1,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).
cnf(property_of_divide1,axiom,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_divide1) ).
cnf(x_divide_x_is_zero,axiom,
divide(X1,X1) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).
cnf(prove_this,negated_conjecture,
divide(divide(identity,a),divide(identity,divide(identity,b))) != divide(divide(identity,b),divide(identity,divide(identity,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_9,plain,
( less_equal(X1,X3)
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X3) ),
inference(fof_simplification,[status(thm)],[transitivity_of_less_equal]) ).
cnf(c_0_10,plain,
( less_equal(divide(X3,X2),divide(X3,X1))
| ~ less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[property_of_divide2]) ).
cnf(c_0_11,plain,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
inference(fof_simplification,[status(thm)],[quotient_less_equal2]) ).
cnf(c_0_12,plain,
( less_equal(X1,X3)
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X3) ),
c_0_9 ).
cnf(c_0_13,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_14,plain,
( less_equal(divide(X3,X2),divide(X3,X1))
| ~ less_equal(X1,X2) ),
c_0_10 ).
cnf(c_0_15,axiom,
less_equal(divide(X1,X2),X1),
quotient_smaller_than_numerator ).
cnf(c_0_16,plain,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[property_of_divide1]) ).
cnf(c_0_17,plain,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
c_0_11 ).
cnf(c_0_18,axiom,
divide(X1,X1) = zero,
x_divide_x_is_zero ).
cnf(c_0_19,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_20,plain,
( less_equal(X1,divide(divide(X2,X3),X4))
| ~ less_equal(X1,divide(divide(X2,X4),divide(X3,X4))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,plain,
less_equal(divide(X1,X2),divide(X1,divide(X2,X3))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
c_0_16 ).
cnf(c_0_23,plain,
less_equal(X1,X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
c_0_19 ).
cnf(c_0_25,plain,
less_equal(divide(divide(X1,X2),X3),divide(divide(X1,X3),X2)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
less_equal(divide(X1,divide(X1,X2)),X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( divide(divide(X1,X2),X3) = divide(divide(X1,X3),divide(X2,X3))
| ~ less_equal(divide(divide(X1,X2),X3),divide(divide(X1,X3),divide(X2,X3))) ),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_28,plain,
divide(divide(X1,X2),X3) = divide(divide(X1,X3),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_25])]) ).
cnf(c_0_29,negated_conjecture,
divide(divide(identity,a),divide(identity,divide(identity,b))) != divide(divide(identity,b),divide(identity,divide(identity,a))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_30,plain,
( divide(X1,divide(X1,X2)) = X2
| ~ less_equal(X2,divide(X1,divide(X1,X2))) ),
inference(spm,[status(thm)],[c_0_24,c_0_26]) ).
cnf(c_0_31,plain,
less_equal(divide(X1,X2),divide(X1,divide(X3,divide(X3,X2)))),
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_32,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X2),X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21])]) ).
cnf(c_0_33,negated_conjecture,
divide(divide(identity,a),divide(identity,divide(identity,b))) != divide(divide(identity,b),divide(identity,divide(identity,a))),
c_0_29 ).
cnf(c_0_34,plain,
divide(X1,divide(X1,divide(X1,X2))) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
divide(divide(X1,X2),divide(divide(X3,X2),X4)) = divide(divide(X1,X2),divide(X3,X4)),
inference(spm,[status(thm)],[c_0_32,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
divide(divide(identity,a),divide(identity,divide(identity,b))) != divide(divide(identity,a),b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_28]),c_0_34]) ).
cnf(c_0_37,plain,
divide(divide(X1,X2),divide(X1,divide(X1,X3))) = divide(divide(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : HEN011-4 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n006.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 22:52:53 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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/benchmark/theBenchmark.p
% 2.06/0.80 # Version: 3.1.0
% 2.06/0.80 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.06/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.06/0.80 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.06/0.80 # Starting new_bool_3 with 300s (1) cores
% 2.06/0.80 # Starting new_bool_1 with 300s (1) cores
% 2.06/0.80 # Starting sh5l with 300s (1) cores
% 2.06/0.80 # new_bool_3 with pid 32192 completed with status 0
% 2.06/0.80 # Result found by new_bool_3
% 2.06/0.80 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.06/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.06/0.80 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.06/0.80 # Starting new_bool_3 with 300s (1) cores
% 2.06/0.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.06/0.80 # Search class: FHUSM-FFSF22-MFFFFFNN
% 2.06/0.80 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.06/0.80 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 181s (1) cores
% 2.06/0.80 # H----_042_B03_F1_AE_Q4_SP_S2S with pid 32196 completed with status 0
% 2.06/0.80 # Result found by H----_042_B03_F1_AE_Q4_SP_S2S
% 2.06/0.80 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.06/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.06/0.80 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.06/0.80 # Starting new_bool_3 with 300s (1) cores
% 2.06/0.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.06/0.80 # Search class: FHUSM-FFSF22-MFFFFFNN
% 2.06/0.80 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.06/0.80 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 181s (1) cores
% 2.06/0.80 # Preprocessing time : 0.001 s
% 2.06/0.80
% 2.06/0.80 # Proof found!
% 2.06/0.80 # SZS status Unsatisfiable
% 2.06/0.80 # SZS output start CNFRefutation
% See solution above
% 2.06/0.80 # Parsed axioms : 18
% 2.06/0.80 # Removed by relevancy pruning/SinE : 0
% 2.06/0.80 # Initial clauses : 18
% 2.06/0.80 # Removed in clause preprocessing : 0
% 2.06/0.80 # Initial clauses in saturation : 18
% 2.06/0.80 # Processed clauses : 4442
% 2.06/0.80 # ...of these trivial : 217
% 2.06/0.80 # ...subsumed : 3938
% 2.06/0.80 # ...remaining for further processing : 287
% 2.06/0.80 # Other redundant clauses eliminated : 0
% 2.06/0.80 # Clauses deleted for lack of memory : 0
% 2.06/0.80 # Backward-subsumed : 11
% 2.06/0.80 # Backward-rewritten : 78
% 2.06/0.80 # Generated clauses : 40648
% 2.06/0.80 # ...of the previous two non-redundant : 16418
% 2.06/0.80 # ...aggressively subsumed : 0
% 2.06/0.80 # Contextual simplify-reflections : 0
% 2.06/0.80 # Paramodulations : 40632
% 2.06/0.80 # Factorizations : 0
% 2.06/0.80 # NegExts : 0
% 2.06/0.80 # Equation resolutions : 16
% 2.06/0.80 # Disequality decompositions : 0
% 2.06/0.80 # Total rewrite steps : 58844
% 2.06/0.80 # ...of those cached : 51967
% 2.06/0.80 # Propositional unsat checks : 0
% 2.06/0.80 # Propositional check models : 0
% 2.06/0.80 # Propositional check unsatisfiable : 0
% 2.06/0.80 # Propositional clauses : 0
% 2.06/0.80 # Propositional clauses after purity: 0
% 2.06/0.80 # Propositional unsat core size : 0
% 2.06/0.80 # Propositional preprocessing time : 0.000
% 2.06/0.80 # Propositional encoding time : 0.000
% 2.06/0.80 # Propositional solver time : 0.000
% 2.06/0.80 # Success case prop preproc time : 0.000
% 2.06/0.80 # Success case prop encoding time : 0.000
% 2.06/0.80 # Success case prop solver time : 0.000
% 2.06/0.80 # Current number of processed clauses : 198
% 2.06/0.80 # Positive orientable unit clauses : 118
% 2.06/0.80 # Positive unorientable unit clauses: 7
% 2.06/0.80 # Negative unit clauses : 0
% 2.06/0.80 # Non-unit-clauses : 73
% 2.06/0.80 # Current number of unprocessed clauses: 11787
% 2.06/0.80 # ...number of literals in the above : 14696
% 2.06/0.80 # Current number of archived formulas : 0
% 2.06/0.80 # Current number of archived clauses : 89
% 2.06/0.80 # Clause-clause subsumption calls (NU) : 8054
% 2.06/0.80 # Rec. Clause-clause subsumption calls : 8054
% 2.06/0.80 # Non-unit clause-clause subsumptions : 2324
% 2.06/0.80 # Unit Clause-clause subsumption calls : 251
% 2.06/0.80 # Rewrite failures with RHS unbound : 258
% 2.06/0.80 # BW rewrite match attempts : 1910
% 2.06/0.80 # BW rewrite match successes : 254
% 2.06/0.80 # Condensation attempts : 0
% 2.06/0.80 # Condensation successes : 0
% 2.06/0.80 # Termbank termtop insertions : 400556
% 2.06/0.80 # Search garbage collected termcells : 19
% 2.06/0.80
% 2.06/0.80 # -------------------------------------------------
% 2.06/0.80 # User time : 0.248 s
% 2.06/0.80 # System time : 0.012 s
% 2.06/0.80 # Total time : 0.260 s
% 2.06/0.80 # Maximum resident set size: 1592 pages
% 2.06/0.80
% 2.06/0.80 # -------------------------------------------------
% 2.06/0.80 # User time : 0.249 s
% 2.06/0.80 # System time : 0.015 s
% 2.06/0.80 # Total time : 0.263 s
% 2.06/0.80 # Maximum resident set size: 1708 pages
% 2.06/0.80 % E---3.1 exiting
% 2.06/0.80 % E exiting
%------------------------------------------------------------------------------