TSTP Solution File: HEN007-3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : HEN007-3 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:56 EDT 2024
% Result : Unsatisfiable 0.16s 0.42s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of clauses : 44 ( 35 unt; 0 nHn; 16 RR)
% Number of literals : 56 ( 19 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal1,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_property) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).
cnf(quotient_less_equal2,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(a_LE_b,hypothesis,
less_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_LE_b) ).
cnf(prove_c_divide_b_LE_c_divide_a,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_divide_b_LE_c_divide_a) ).
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,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_12,plain,
divide(divide(X1,X2),X1) = zero,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_14,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_15,plain,
less_equal(divide(divide(X1,X1),divide(X2,X1)),zero),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
divide(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
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,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
c_0_14 ).
cnf(c_0_19,plain,
less_equal(divide(divide(X1,X1),zero),zero),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13])]) ).
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_11,c_0_16]) ).
cnf(c_0_24,plain,
divide(X1,X1) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_13])]) ).
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_18,c_0_25]),c_0_13])]) ).
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,hypothesis,
less_equal(a,b),
a_LE_b ).
cnf(c_0_29,plain,
divide(X1,divide(X1,zero)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_27]),c_0_13])]) ).
cnf(c_0_30,hypothesis,
divide(a,b) = zero,
inference(spm,[status(thm)],[c_0_9,c_0_28]) ).
cnf(c_0_31,plain,
less_equal(X1,divide(X1,zero)),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_32,hypothesis,
less_equal(divide(divide(X1,b),zero),divide(divide(X1,a),b)),
inference(spm,[status(thm)],[c_0_11,c_0_30]) ).
cnf(c_0_33,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_31]),c_0_10])]) ).
cnf(c_0_34,plain,
less_equal(divide(divide(X1,X2),zero),divide(divide(X1,divide(X2,X3)),X2)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_35,hypothesis,
less_equal(divide(X1,b),divide(divide(X1,a),b)),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
less_equal(divide(X1,X2),divide(divide(X1,divide(X2,X3)),X2)),
inference(rw,[status(thm)],[c_0_34,c_0_33]) ).
cnf(c_0_37,hypothesis,
divide(divide(X1,b),divide(divide(X1,a),b)) = zero,
inference(spm,[status(thm)],[c_0_9,c_0_35]) ).
cnf(c_0_38,hypothesis,
less_equal(divide(divide(X1,b),divide(X1,a)),zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_16]) ).
cnf(c_0_39,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
inference(fof_simplification,[status(thm)],[prove_c_divide_b_LE_c_divide_a]) ).
cnf(c_0_40,hypothesis,
divide(divide(X1,b),divide(X1,a)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_38]),c_0_33]) ).
cnf(c_0_41,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
c_0_39 ).
cnf(c_0_42,hypothesis,
less_equal(divide(X1,b),divide(X1,a)),
inference(spm,[status(thm)],[c_0_20,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : HEN007-3 : TPTP v8.2.0. Released v1.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n021.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 22:55:53 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.40 Running first-order model finding
% 0.16/0.40 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.16/0.42 # Version: 3.1.0
% 0.16/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # Starting sh5l with 300s (1) cores
% 0.16/0.42 # sh5l with pid 7985 completed with status 0
% 0.16/0.42 # Result found by sh5l
% 0.16/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # Starting sh5l with 300s (1) cores
% 0.16/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.42 # Search class: FHUSS-FFSF22-SFFFFFNN
% 0.16/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.16/0.42 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 7993 completed with status 0
% 0.16/0.42 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.16/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # Starting sh5l with 300s (1) cores
% 0.16/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.42 # Search class: FHUSS-FFSF22-SFFFFFNN
% 0.16/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.16/0.42 # Preprocessing time : 0.001 s
% 0.16/0.42 # Presaturation interreduction done
% 0.16/0.42
% 0.16/0.42 # Proof found!
% 0.16/0.42 # SZS status Unsatisfiable
% 0.16/0.42 # SZS output start CNFRefutation
% See solution above
% 0.16/0.42 # Parsed axioms : 9
% 0.16/0.42 # Removed by relevancy pruning/SinE : 1
% 0.16/0.42 # Initial clauses : 8
% 0.16/0.42 # Removed in clause preprocessing : 0
% 0.16/0.42 # Initial clauses in saturation : 8
% 0.16/0.42 # Processed clauses : 92
% 0.16/0.42 # ...of these trivial : 4
% 0.16/0.42 # ...subsumed : 22
% 0.16/0.42 # ...remaining for further processing : 66
% 0.16/0.42 # Other redundant clauses eliminated : 2
% 0.16/0.42 # Clauses deleted for lack of memory : 0
% 0.16/0.42 # Backward-subsumed : 0
% 0.16/0.42 # Backward-rewritten : 24
% 0.16/0.42 # Generated clauses : 636
% 0.16/0.42 # ...of the previous two non-redundant : 212
% 0.16/0.42 # ...aggressively subsumed : 0
% 0.16/0.42 # Contextual simplify-reflections : 0
% 0.16/0.42 # Paramodulations : 634
% 0.16/0.42 # Factorizations : 0
% 0.16/0.42 # NegExts : 0
% 0.16/0.42 # Equation resolutions : 2
% 0.16/0.42 # Disequality decompositions : 0
% 0.16/0.42 # Total rewrite steps : 990
% 0.16/0.42 # ...of those cached : 800
% 0.16/0.42 # Propositional unsat checks : 0
% 0.16/0.42 # Propositional check models : 0
% 0.16/0.42 # Propositional check unsatisfiable : 0
% 0.16/0.42 # Propositional clauses : 0
% 0.16/0.42 # Propositional clauses after purity: 0
% 0.16/0.42 # Propositional unsat core size : 0
% 0.16/0.42 # Propositional preprocessing time : 0.000
% 0.16/0.42 # Propositional encoding time : 0.000
% 0.16/0.42 # Propositional solver time : 0.000
% 0.16/0.42 # Success case prop preproc time : 0.000
% 0.16/0.42 # Success case prop encoding time : 0.000
% 0.16/0.42 # Success case prop solver time : 0.000
% 0.16/0.42 # Current number of processed clauses : 34
% 0.16/0.42 # Positive orientable unit clauses : 24
% 0.16/0.42 # Positive unorientable unit clauses: 0
% 0.16/0.42 # Negative unit clauses : 0
% 0.16/0.42 # Non-unit-clauses : 10
% 0.16/0.42 # Current number of unprocessed clauses: 114
% 0.16/0.42 # ...number of literals in the above : 122
% 0.16/0.42 # Current number of archived formulas : 0
% 0.16/0.42 # Current number of archived clauses : 32
% 0.16/0.42 # Clause-clause subsumption calls (NU) : 56
% 0.16/0.42 # Rec. Clause-clause subsumption calls : 56
% 0.16/0.42 # Non-unit clause-clause subsumptions : 22
% 0.16/0.42 # Unit Clause-clause subsumption calls : 4
% 0.16/0.42 # Rewrite failures with RHS unbound : 0
% 0.16/0.42 # BW rewrite match attempts : 75
% 0.16/0.42 # BW rewrite match successes : 16
% 0.16/0.42 # Condensation attempts : 0
% 0.16/0.42 # Condensation successes : 0
% 0.16/0.42 # Termbank termtop insertions : 6467
% 0.16/0.42 # Search garbage collected termcells : 13
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.005 s
% 0.16/0.42 # System time : 0.004 s
% 0.16/0.42 # Total time : 0.009 s
% 0.16/0.42 # Maximum resident set size: 1612 pages
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.006 s
% 0.16/0.42 # System time : 0.006 s
% 0.16/0.42 # Total time : 0.012 s
% 0.16/0.42 # Maximum resident set size: 1708 pages
% 0.16/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------