TSTP Solution File: HEN006-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : HEN006-6 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:50:49 EDT 2023
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 20 unt; 0 nHn; 19 RR)
% Number of literals : 40 ( 18 equ; 14 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 : 36 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal1,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.bfsZUNCoiy/E---3.1_576.p',quotient_less_equal1) ).
cnf(a_divide_b_LE_d,hypothesis,
less_equal(divide(a,b),d),
file('/export/starexec/sandbox2/tmp/tmp.bfsZUNCoiy/E---3.1_576.p',a_divide_b_LE_d) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
file('/export/starexec/sandbox2/tmp/tmp.bfsZUNCoiy/E---3.1_576.p',quotient_property) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.bfsZUNCoiy/E---3.1_576.p',less_equal_and_equal) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox2/tmp/tmp.bfsZUNCoiy/E---3.1_576.p',zero_is_smallest) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/tmp.bfsZUNCoiy/E---3.1_576.p',quotient_smaller_than_numerator) ).
cnf(zero_divide_anything_is_zero,axiom,
divide(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/tmp.bfsZUNCoiy/E---3.1_576.p',zero_divide_anything_is_zero) ).
cnf(quotient_less_equal2,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox2/tmp/tmp.bfsZUNCoiy/E---3.1_576.p',quotient_less_equal2) ).
cnf(prove_a_divide_d_LE_b,negated_conjecture,
~ less_equal(divide(a,d),b),
file('/export/starexec/sandbox2/tmp/tmp.bfsZUNCoiy/E---3.1_576.p',prove_a_divide_d_LE_b) ).
cnf(c_0_9,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
quotient_less_equal1 ).
cnf(c_0_10,hypothesis,
less_equal(divide(a,b),d),
a_divide_b_LE_d ).
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,hypothesis,
divide(divide(a,b),d) = zero,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_14,hypothesis,
less_equal(divide(divide(a,d),divide(b,d)),zero),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_16,axiom,
less_equal(divide(X1,X2),X1),
quotient_smaller_than_numerator ).
cnf(c_0_17,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_13,c_0_11]) ).
cnf(c_0_18,hypothesis,
divide(divide(a,d),divide(b,d)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_19,axiom,
divide(zero,X1) = zero,
zero_divide_anything_is_zero ).
cnf(c_0_20,plain,
( divide(X1,X2) = X1
| ~ less_equal(X1,divide(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_21,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
quotient_less_equal2 ).
cnf(c_0_22,hypothesis,
divide(divide(divide(a,d),X1),divide(divide(b,d),X1)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_19]),c_0_15])]) ).
cnf(c_0_23,plain,
divide(divide(X1,X2),X1) = zero,
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
~ less_equal(divide(a,d),b),
prove_a_divide_d_LE_b ).
cnf(c_0_25,plain,
( divide(X1,X2) = X1
| divide(X1,divide(X1,X2)) != zero ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,hypothesis,
divide(divide(divide(a,d),b),zero) = zero,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
divide(divide(a,d),b) != zero,
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_28,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_26])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : HEN006-6 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 11:17:01 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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/tmp/tmp.bfsZUNCoiy/E---3.1_576.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 675 completed with status 0
% 0.21/0.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.53 # Starting sh5l with 136s (1) cores
% 0.21/0.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 681 completed with status 0
% 0.21/0.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 12
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 12
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 12
% 0.21/0.53 # Processed clauses : 67
% 0.21/0.53 # ...of these trivial : 5
% 0.21/0.53 # ...subsumed : 14
% 0.21/0.53 # ...remaining for further processing : 48
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 0
% 0.21/0.53 # Backward-rewritten : 5
% 0.21/0.53 # Generated clauses : 696
% 0.21/0.53 # ...of the previous two non-redundant : 298
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 696
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Total rewrite steps : 1188
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 43
% 0.21/0.53 # Positive orientable unit clauses : 25
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 2
% 0.21/0.53 # Non-unit-clauses : 16
% 0.21/0.53 # Current number of unprocessed clauses: 235
% 0.21/0.53 # ...number of literals in the above : 305
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 5
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 43
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 43
% 0.21/0.53 # Non-unit clause-clause subsumptions : 14
% 0.21/0.53 # Unit Clause-clause subsumption calls : 2
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 29
% 0.21/0.53 # BW rewrite match successes : 5
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 9381
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.009 s
% 0.21/0.53 # System time : 0.002 s
% 0.21/0.53 # Total time : 0.011 s
% 0.21/0.53 # Maximum resident set size: 1600 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.047 s
% 0.21/0.53 # System time : 0.007 s
% 0.21/0.53 # Total time : 0.054 s
% 0.21/0.53 # Maximum resident set size: 1676 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------