TSTP Solution File: HEN010-3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : HEN010-3 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:34:00 EDT 2024
% Result : Unsatisfiable 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of clauses : 48 ( 29 unt; 0 nHn; 24 RR)
% Number of literals : 72 ( 42 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 81 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
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_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_less_equal2,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox2/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/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(identity_is_largest,axiom,
less_equal(X1,identity),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',identity_is_largest) ).
cnf(prove_property_of_inversion,negated_conjecture,
divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_of_inversion) ).
cnf(c_0_8,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_9,plain,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[quotient_less_equal1]) ).
cnf(c_0_10,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
c_0_8 ).
cnf(c_0_11,axiom,
less_equal(divide(X1,X2),X1),
quotient_smaller_than_numerator ).
cnf(c_0_12,plain,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
inference(fof_simplification,[status(thm)],[quotient_less_equal2]) ).
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,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
c_0_9 ).
cnf(c_0_15,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_16,plain,
( divide(X1,X2) = X1
| ~ less_equal(X1,divide(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
c_0_12 ).
cnf(c_0_18,plain,
( divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X3),X2)
| ~ less_equal(divide(divide(X1,X3),X2),divide(divide(X1,X2),divide(X3,X2))) ),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_19,plain,
divide(divide(X1,X2),X1) = zero,
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_20,plain,
divide(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( divide(X1,X2) = X1
| divide(X1,divide(X1,X2)) != zero ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
divide(divide(X1,X1),divide(X2,X1)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15])]) ).
cnf(c_0_23,plain,
( divide(divide(X1,X2),zero) = divide(divide(X1,zero),X2)
| ~ less_equal(divide(divide(X1,zero),X2),divide(divide(X1,X2),zero)) ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_24,plain,
divide(X1,X1) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_19]) ).
cnf(c_0_25,plain,
( X1 = X2
| divide(X2,X1) != zero
| ~ less_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
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_23,c_0_24]),c_0_15])]) ).
cnf(c_0_27,axiom,
less_equal(X1,identity),
identity_is_largest ).
cnf(c_0_28,plain,
( X1 = X2
| divide(X2,X1) != zero
| divide(X1,X2) != zero ),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
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_21,c_0_26]),c_0_26])]) ).
cnf(c_0_30,plain,
divide(X1,identity) = zero,
inference(spm,[status(thm)],[c_0_14,c_0_27]) ).
cnf(c_0_31,plain,
( divide(divide(X1,divide(X2,X3)),X2) = divide(divide(X1,X2),zero)
| ~ less_equal(divide(divide(X1,divide(X2,X3)),X2),divide(divide(X1,X2),zero)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_32,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_19])]) ).
cnf(c_0_33,plain,
divide(divide(X1,X2),divide(identity,X2)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_30]),c_0_20]),c_0_20]),c_0_15])]) ).
cnf(c_0_34,plain,
( divide(divide(X1,divide(X2,X3)),X2) = divide(X1,X2)
| ~ less_equal(divide(divide(X1,divide(X2,X3)),X2),divide(X1,X2)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_32]) ).
cnf(c_0_35,plain,
divide(divide(divide(X1,X2),X3),divide(X1,X3)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_20]),c_0_15])]) ).
cnf(c_0_36,plain,
( divide(identity,X1) = divide(X2,X1)
| divide(divide(identity,X1),divide(X2,X1)) != zero ),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_37,plain,
divide(divide(X1,divide(identity,X2)),divide(X2,divide(identity,X2))) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_33]),c_0_15])]) ).
cnf(c_0_38,plain,
divide(divide(X1,divide(X2,X3)),X2) = divide(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_17]),c_0_35])]) ).
cnf(c_0_39,negated_conjecture,
divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))),
inference(fof_simplification,[status(thm)],[prove_property_of_inversion]) ).
cnf(c_0_40,plain,
divide(identity,divide(identity,X1)) = divide(X1,divide(identity,X1)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
less_equal(divide(X1,X2),divide(X1,divide(X2,X3))),
inference(spm,[status(thm)],[c_0_11,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))),
c_0_39 ).
cnf(c_0_43,plain,
( divide(identity,divide(identity,X1)) = X1
| ~ less_equal(X1,divide(identity,divide(identity,X1))) ),
inference(spm,[status(thm)],[c_0_16,c_0_40]) ).
cnf(c_0_44,plain,
less_equal(divide(X1,X2),divide(X1,divide(identity,divide(identity,X2)))),
inference(spm,[status(thm)],[c_0_41,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
divide(identity,divide(identity,divide(identity,a))) != divide(identity,a),
inference(rw,[status(thm)],[c_0_42,c_0_40]) ).
cnf(c_0_46,plain,
divide(identity,divide(identity,divide(identity,X1))) = divide(identity,X1),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : HEN010-3 : TPTP v8.2.0. Released v1.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n017.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:49:08 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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.47 # Version: 3.1.0
% 0.16/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 15721 completed with status 0
% 0.16/0.47 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.47 # No SInE strategy applied
% 0.16/0.47 # Search class: FHUSM-FFSF22-MFFFFFNN
% 0.16/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.47 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 811s (1) cores
% 0.16/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.16/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.47 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 15728 completed with status 0
% 0.16/0.47 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.47 # No SInE strategy applied
% 0.16/0.47 # Search class: FHUSM-FFSF22-MFFFFFNN
% 0.16/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.47 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 811s (1) cores
% 0.16/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.47 # Preprocessing time : 0.002 s
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Unsatisfiable
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 8
% 0.16/0.47 # Removed by relevancy pruning/SinE : 0
% 0.16/0.47 # Initial clauses : 8
% 0.16/0.47 # Removed in clause preprocessing : 0
% 0.16/0.47 # Initial clauses in saturation : 8
% 0.16/0.47 # Processed clauses : 159
% 0.16/0.47 # ...of these trivial : 30
% 0.16/0.47 # ...subsumed : 52
% 0.16/0.47 # ...remaining for further processing : 77
% 0.16/0.47 # Other redundant clauses eliminated : 0
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 0
% 0.16/0.47 # Backward-rewritten : 21
% 0.16/0.47 # Generated clauses : 3254
% 0.16/0.47 # ...of the previous two non-redundant : 1339
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 0
% 0.16/0.47 # Paramodulations : 3254
% 0.16/0.47 # Factorizations : 0
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 0
% 0.16/0.47 # Disequality decompositions : 0
% 0.16/0.47 # Total rewrite steps : 6543
% 0.16/0.47 # ...of those cached : 5552
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 56
% 0.16/0.47 # Positive orientable unit clauses : 36
% 0.16/0.47 # Positive unorientable unit clauses: 1
% 0.16/0.47 # Negative unit clauses : 0
% 0.16/0.47 # Non-unit-clauses : 19
% 0.16/0.47 # Current number of unprocessed clauses: 1123
% 0.16/0.47 # ...number of literals in the above : 1368
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 21
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 191
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 191
% 0.16/0.47 # Non-unit clause-clause subsumptions : 49
% 0.16/0.47 # Unit Clause-clause subsumption calls : 11
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 161
% 0.16/0.47 # BW rewrite match successes : 18
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 45998
% 0.16/0.47 # Search garbage collected termcells : 10
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.032 s
% 0.16/0.47 # System time : 0.006 s
% 0.16/0.47 # Total time : 0.037 s
% 0.16/0.47 # Maximum resident set size: 1648 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.139 s
% 0.16/0.47 # System time : 0.010 s
% 0.16/0.47 # Total time : 0.149 s
% 0.16/0.47 # Maximum resident set size: 1700 pages
% 0.16/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------